相关论文: Four-coloring Eulerian triangulations of the torus

We show that any equation from the Davey--Stewartson hierarchy induces an infinite family of geometrically different deformations of tori in $\R^4$ preserving the Willmore functional. We expose a derivation of the Weierstrass representation…

We give an explicit procedure for $5$-list-coloring a large class of toroidal $6$-regular triangulations in linear time. We also show that these graphs are not $3$-choosable.

Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…

We propose the notion of a majority $k$-edge-coloring of a graph $G$, which is an edge-coloring of $G$ with $k$ colors such that, for every vertex $u$ of $G$, at most half the edges of $G$ incident with $u$ have the same color. We show the…

The group of bordism classes of unoriented surfaces in 4-space is determined. The bordism classes are characterized by normal Euler numbers,double linking numbers, and triple linking numbers.

It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on…

We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…

We prove that any asymptotically locally Euclidean scalar-flat K\"ahler 4-orbifold whose isometry group contains a 2-torus is isometric, up to an orbifold covering, to a quaternionic-complex quotient of a $k$-dimensional quaternionic vector…

The Four Colour Theorem asserts that the vertices of every plane graph can be properly coloured with four colors. Fabrici and G\"oring conjectured the following stronger statement to also hold: the vertices of every plane graph can be…

A \emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $D$ is \emph{majority $k$-choosable} if for any assignment of…

We exploit techniques from classical (real and complex) algebraic geometry for the study of the standard twistor fibration $\pi:\mathbb{CP}^{3}\to S^{4}$. We prove three results about the topology of the twistor discriminant locus of an…

If a finite group of orientation-preserving diffeomorphisms of the 3-dimensional torus leaves invariant an oriented, closed, embedded surface of genus g>1 and preserves the orientation of the surface, then its order is bounded from above by…

We prove that any compact selfdual Einstein 4-orbifold of positive scalar curvature whose isometry group contains a 2-torus is, up to an orbifold covering, a quaternion Kaehler quotient of (k-1)-dimensional quaternionic projective space by…

We consider a central extension of the mapping class group of a surface with a collection of framed colored points. The Witten-Reshetikhin-Turaev TQFTs associated to SU(2) and SO(3) induce linear representations of this group. We show that…

Let $H$ be a $3$-regular $4$-uniform hypergraph on $n$ vertices. The transversal number $\tau(H)$ of $H$ is the minimum number of vertices that intersect every edge. Lai and Chang [J. Combin. Theory Ser. B 50 (1990), 129--133] proved that…

For a compact surface $ S $ with a finite set of marked points $ P $, we define a 1-system to be a collection of arcs which are pairwise non-homotopic and intersect pairwise at most once. We prove that, up to equivalence, there are exactly…

We show that if a coloring of the plane has the properties that any two points at distance one are colored differently and the plane is partitioned into uniformly colored triangles under certain conditions, then it requires at least seven…

A repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is repetition-free or nonrepetitive if there is no path with a color pattern that is a repetition. The minimum number…

For integers $n\ge 0$, an iterated triangulation $Tr(n)$ is defined recursively as follows: $Tr(0)$ is the plane triangulation on three vertices and, for $n\ge 1$, $Tr(n)$ is the plane triangulation obtained from the plane triangulation…

We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.