相关论文: Continued Fractions and the 4-Color Theorem

In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus…

The attempts to prove the Four Color Problem last for long years. A little hope arises that the properties of the minimal partial triangulations will be very useful for the solution of the Four Color Problem. That is why the material of…

Youngs proved that every non-bipartite quadrangulation of the projective plane $\mathbb{R}\mathrm{P}^2$ is 4-chromatic. Kaiser and Stehl\'{\i}k [J. Combin. Theory Ser. B 113 (2015), 1-17] generalised the notion of a quadrangulation to…

Proving for triangulations an extended version of the 4-colour theorem by induction, we manage to exclude the case which led to the failure of Kempe's attempted proof. The new idea is to claim the existence of a "nice" 4-colouring, in which…

We prove the convergence of a wide class of continued fractions, including generalized continued fractions over quaternions and octonions. Fractional points in these systems are not bounded away from the unit sphere, so that the iteration…

Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…

It is shown that the geometry of parallelizable manifolds can be extended to non-parallelizable ones by extending the connection that a global frame field would define on a parallelizable manifold to a connection that a singular frame field…

Aksenov proved that in a planar graph G with at most one triangle, every precoloring of a 4-cycle can be extended to a 3-coloring of G. We give an exact characterization of planar graphs with two triangles in that some precoloring of a…

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

We consider the 4-precoloring extension problem in \emph{planar near-Eulerian-triangulations}, i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even…

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…

An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part…

We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently…

We show that, for every $\epsilon>0$, the 4-regular tree has an fiid 4-coloring where a given vertex is assigned the 4th color with probability at most $\epsilon$. We also construct 5-colorings of $T_6$ improving known bounds on the…

Curves in ${\mathbb R}^n$ for which the ratios between two consecutive curvatures are constant are characterized by the fact that their tangent indicatrix is a geodesic in a flat torus. For $n= 3,4$, spherical curves of this kind are also…

We prove a comparison theorem for the isoperimetric profiles of simple closed curves evolving by the normalized curve shortening flow: If the isoperimetric profile of the region enclosed by the initial curve is greater than that of some…

We study 3-coloring properties of triangle-free planar graphs $G$ with two precolored 4-cycles $C_1$ and $C_2$ that are far apart. We prove that either every precoloring of $C_1\cup C_2$ extends to a 3-coloring of $G$, or $G$ contains one…

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

We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…

This paper aims to introduce high school students to the intriguing world of continued fractions, a mathematical concept that provides a unique representation of numbers. The study focuses on the exploration and development of the…