Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Erd?s problems and related topics of discrete geometry (52C10)
Cites work
- A Combinatorial Classic — Sparse Graphs with High Chromatic Number
- A counterexample to Borsuk’s conjecture
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- A Sparse Graham-Rothschild Theorem
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number
- Chromatic numbers and homomorphisms of large girth hypergraphs
- Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra
- Coloring distance graphs and graphs of diameters
- Coloring, sparseness and girth
- Counterexamples to Borsuk's conjecture on spheres of small radii
- Counterexamples to Borsuk's conjecture with large girth
- Disjointness graphs of short polygonal chains
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size
- Distance graphs with large chromatic number and arbitrary girth
- Drei Sätze über die n-dimensionale euklidische Sphäre.
- Graph Theory and Probability
- scientific article; zbMATH DE number 3650587 (Why is no real title available?)
- scientific article; zbMATH DE number 15377 (Why is no real title available?)
- scientific article; zbMATH DE number 177380 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 718861 (Why is no real title available?)
- scientific article; zbMATH DE number 1452727 (Why is no real title available?)
- scientific article; zbMATH DE number 874074 (Why is no real title available?)
- scientific article; zbMATH DE number 927067 (Why is no real title available?)
- scientific article; zbMATH DE number 1406333 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- scientific article; zbMATH DE number 3098608 (Why is no real title available?)
- Illuminating sets of constant width
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Intersection theorems with geometric consequences
- Lower bounds for the chromatic numbers of distance graphs with large girth
- On a bound in Borsuk's problem
- On a Frankl-Wilson theorem and its geometric corollaries
- On a Probabilistic Graph-Theoretical Method
- On chromatic number of finite set-systems
- On chromatic number of graphs and set-systems
- On distance graphs with large chromatic number but without large simplices
- On the chromatic number of a space
- Proof of Schur's conjecture in R^D
- Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
- Ramanujan graphs
- Subgraphs of Kneser graphs with large girth and large chromatic number
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- The realization of distances within sets in Euclidean space
- Three lectures on the Borsuk partition problem
- Two notions of unit distance graphs
This page was built for publication: Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901002)
