Related papers: A solution to Ringel's circle problem
A class of simple graphs such as ${\cal G}$ is said to be {\it odd-girth-closed} if for any positive integer $g$ there exists a graph $G \in {\cal G}$ such that the odd-girth of $G$ is greater than or equal to $g$. An odd-girth-closed class…
We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…
Nagata solved Hilbert's 14-th problem in 1958 in the negative. The solution naturally lead him to a tantalizing conjecture that remains widely open after more than half a century of intense efforts. Using Nagata's theorem as starting point,…
We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation…
Square grid circle patterns with prescribed intersection angles, mimicking holomorphic maps z^a and log(z) are studied. It is shown that the corresponding circle patterns are imbedded and described by special separatrix solutions of…
Let $k$ be a number field. We refine a construction of Mestre--Shioda to construct (infinite) families of hyperelliptic curves $X/{k}$ having a record number of rational points and record Mordell--Weil rank relative to the genus of $g$ of…
We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d, then G is 3-colorable. In fact, we prove a more general…
We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…
It is known that the truncated Brown--Peterson spectra can be equipped with a certain nice algebra structure, by the work of J. Hahn and D. Wilson, and these ring spectra can be viewed as rings of integers of local fields in chromatic…
We introduce orthogonal ring patterns consisting of pairs of concentric circles generalizing circle patterns. We show that orthogonal ring patterns are governed by the same equation as circle patterns. For every ring pattern there exists a…
For every $2$-regular graph $F$ of order $v$, the Oberwolfach problem $OP(F)$ asks whether there is a $2$-factorization of $K_v$ ($v$ odd) or $K_v$ minus a $1$-factor ($v$ even) into copies of $F$. Posed by Ringel in 1967 and extensively…
We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the difference of the chromatic number and the order is a small…
A tautological system, introduced in [16][17], arises as a regular holonomic system of partial differential equations that govern the period integrals of a family of complete intersections in a complex manifold $X$, equipped with a suitable…
SU(2) Yang-Mills theory coupled in a non-minimal way to two scalar fields is discussed. For the massless scalar fields a family of finite energy solutions generated by an external, static electric charge is found. Additionally, there is a…
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
Computing the clique number and chromatic number of a general graph are well-known NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness results and spectral techniques for combinatorial problems…
It is shown that a polynomial map $(P,Q)\in \mathbb{Q}[x,y]^2$ with $P_xQ_y-P_yQ_x \equiv 1$ has an inverse map in $\mathbb{Q}[x,y]^2$ if the fiber $P=0$ contains an infinite subset of $ d^{-1}\mathbb{Z}^2$ for an integer $d$.
The Kervaire Invariant 1 Problem until recently was an open problem in algebraic topology. Hill-Hopkins-Ravenel theorem clams a negative solution of the problem for all dimensions $n=2^l-2$, $l \ge 8$. We prove the statement of…
A circle graph is a graph in which the adjacency of vertices can be represented as the intersection of chords of a circle. The problem of calculating the chromatic number is known to be NP-complete, even on circle graphs. In this paper, we…
The rainbow arborescence conjecture posits that if the arcs of a directed graph with $n$ vertices are colored by $n-1$ colors such that each color class forms a spanning arborescence, then there is a spanning arborescence that contains…