Independence numbers and chromatic numbers of some distance graphs
From MaRDI portal
Publication:259909
Recommendations
Cites work
- scientific article; zbMATH DE number 4043856 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 2070003 (Why is no real title available?)
- scientific article; zbMATH DE number 1775058 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- Around Borsuk's hypothesis
- Borsuk's problem and the chromatic numbers of some metric spaces
- Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
- Coloring distance graphs and graphs of diameters
- Coloring some finite sets in \(\mathbb R^n\)
- Forbidding just one intersection
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems with geometric consequences
- Kneser's conjecture, chromatic number, and homotopy
- Lectures on advances in combinatorics
- On a packing and covering problem
- On the chromatic number of a space
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
- Research Problems in Discrete Geometry
- The Borsuk partition problem: the seventieth anniversary
- The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Mathematical Coloring Book
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
- The problems of Borsuk and Grunbaum on lattice polytopes
- The realization of distances within sets in Euclidean space
- Three lectures on the Borsuk partition problem
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- What we know and what we do not know about Turán numbers
Cited in
(20)- Independence and chromatic densities of graphs
- Turán-type bounds for distance graphs
- Hasse diagrams with large chromatic number
- Turán-type results for distance graphs in an infinitesimal plane layer
- On the independence ratio of distance graphs
- Distance independence polynomial of graphs
- On chromatic numbers of close-to-Kneser distance graphs
- Independence numbers of Johnson-type graphs
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Independence number and packing coloring of generalized Mycielski graphs
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- Chromatic numbers of some distance graphs
- Modularity of some distance graphs
- Chromatic numbers of Kneser-type graphs
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
- Chromatic number, independence ratio, and crossing number
- On the structure of distance graphs with a large chromatic number
- On the number of edges of a uniform hypergraph with a range of allowed intersections
This page was built for publication: Independence numbers and chromatic numbers of some distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259909)
