Counterexamples to Borsuk's conjecture with large girth
From MaRDI portal
Publication:2334928
DOI10.1134/S0001434619050249zbMath1426.05034OpenAlexW2955743605WikidataQ123365767 ScholiaQ123365767MaRDI QIDQ2334928
Publication date: 8 November 2019
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434619050249
Related Items (15)
Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ On a Frankl-Wilson theorem ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On the partition of plane sets into 6 subsets of small diameter ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On stability of the independence number of a certain distance graph ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ Modularity of some distance graphs ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ Covering planar sets ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the measurable chromatic number of a space of dimension \(n \leq 24\)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
- The chromatic number of space with forbidden regular simplex
- Proof of Schur's conjecture in \(\mathbb R^D\)
- On lower bounds for the chromatic number of sphere
- On a Frankl-Rödl theorem and its geometric corollaries
- Distance graphs with large chromatic number and arbitrary girth
- Exponentially Ramsey sets
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the chromatic numbers of low-dimensional spaces
- On the chromatic number of a space with a forbidden regular simplex
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Counterexamples to Borsuk's conjecture on spheres of small radii
- Around Borsuk's hypothesis
- Excursions into combinatorial geometry
- The Difference Between Consecutive Primes, II
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- A counterexample to Borsuk’s conjecture
- Research Problems in Discrete Geometry
- Graph Theory and Probability
- The Mathematical Coloring Book
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- On the chromatic number of an infinitesimal plane layer
- On the Frankl–Rödl theorem
- Combinatorial Geometry and Coding Theory*
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- On chromatic number of finite set-systems
- The realization of distances within sets in Euclidean space
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: Counterexamples to Borsuk's conjecture with large girth
