English
Related papers

Related papers: A solution to Ringel's circle problem

200 papers

Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…

Combinatorics · Mathematics 2022-11-30 Zhora Nikoghosyan

In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].

Functional Analysis · Mathematics 2025-04-22 Yacine Chitour , Jochen Denzler , Frédéric Jean , Emmanuel Trélat

A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for…

Geometric Topology · Mathematics 2009-09-29 Boris A. Springborn

Given a family of curves $\mathcal{C}$ in the plane, its disjointness graph is the graph whose vertices correspond to the elements of $\mathcal{C}$, and two vertices are joined by an edge if and only if the corresponding sets are disjoint.…

Combinatorics · Mathematics 2019-08-23 Janos Pach , Istvan Tomon

We determine the distribution of nearest neighbour spacings between the tangencies to a fixed circle in a class of circle packings generated by reflections. We use a combination of geometric tools and the theory of automorphic forms.

Number Theory · Mathematics 2015-09-11 Zeev Rudnick , Xin Zhang

Let $G$ be a finite group. Then there exists a first-order statement $S(G)$ in the language of rings without parameters and depending only on $G$ such that, for any field $K$, we have that $K\models S(G)$ if and only if $K$ has a Galois…

Number Theory · Mathematics 2023-12-25 Francesca Balestrieri , Jennifer Park , Alexandra Shlapentokh

We study an anti-Ramsey extension of the classical Corr\'{a}di--Hajnal Theorem: how many colors are needed to color the complete graph on $n$ vertices in order to guarantee a rainbow copy of $t K_{3}$, that is, $t$ vertex-disjoint…

Combinatorics · Mathematics 2025-10-07 Deng Jinghua , Hou Jianfeng , Hu caiyun , Liu xizhi

Hadwiger Conjecture has been an open problem for over a half century1,6, which says that there is at most a complete graph Kt but no Kt+1 for every t-colorable graph. A few cases of Hadwiger Conjecture, such as 1, 2, 3, 4, 5, 6-colorable…

Combinatorics · Mathematics 2021-04-29 T. -Q. Wang , X. -J. Wang

We describe an explicit version of Hilbert's irreducibility theorem using a generalization of Gallagher's larger sieve. We give applications to the Galois theory of random polynomials, and to the images of the adelic representation…

Number Theory · Mathematics 2010-12-01 David Zywina

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

Computational Geometry · Computer Science 2010-08-03 Daniel Werner , Matthias Lenz

We answer a question posed by T. Gallai in 1969 concerning criticality in Sperner's lemma, listed as Problem 9.14 in the collection of Jensen and Toft [Graph coloring problems, John Wiley & Sons, Inc., New York, 1995]. Sperner's lemma…

Combinatorics · Mathematics 2024-04-24 Tomáš Kaiser , Matěj Stehlík , Riste Škrekovski

Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…

The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme…

Combinatorics · Mathematics 2014-12-31 Alexander Engstrom

In this short note, we use flag algebras to prove that the number of colour alternating 6-cycles in a red/blue colouring of a large clique is asymptotically maximized by a uniformly random colouring. This settles the first open case of a…

Combinatorics · Mathematics 2025-05-16 Hao Chen , Jonathan A. Noel

Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…

Mathematical Physics · Physics 2009-11-30 Bertrand Eynard , Nicolas Orantin

To construct a curve with a monotonic curvature (spiral), and given tangents and curvatures at the ends, the author proposed the following method. From given boundary conditions, the values of two inverse invariants are determined. Then, on…

Differential Geometry · Mathematics 2026-04-01 Alexey Kurnosenko

We first generate ray class fields over imaginary quadratic fields in terms of Siegel-Ramachandra invariants, which would be an extension of Schertz's result. And, by making use of quotients of Siegel-Ramachandra invariants we also…

Number Theory · Mathematics 2018-02-02 Ja Kyung Koo , Dong Sung Yoon

One widely applied sufficient condition for the existence of a colorful simplex in a vertex-colored simplicial complex is a topological extension of Hall's transversal theorem due to Aharoni, Haxell, and Meshulam. We prove a similar…

Combinatorics · Mathematics 2025-11-10 Ronen Wdowinski

John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…

General Mathematics · Mathematics 2021-11-04 Eric Braude

We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle. The homeomorphism is constructed using the exponential of $\beta X$ where $X$ is the restriction of the…

Complex Variables · Mathematics 2009-09-08 K. Astala , P. Jones , A. Kupiainen , E. Saksman