On chromatic numbers of close-to-Kneser distance graphs
From MaRDI portal
Recommendations
Cites work
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Coloring some finite sets in R^n
- Forbidden Intersections
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 4023282 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3458659 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- Independence numbers and chromatic numbers of some distance graphs
- Intersection theorems with geometric consequences
- Lovász' theorem on the chromatic number of spheres revisited
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On the chromatic number of a space with forbidden equilateral triangle
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Research Problems in Discrete Geometry
- The complete nontrivial-intersection theorem for systems of finite sets
- 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
Cited in
(9)- On the number of edges of a uniform hypergraph with a range of allowed intersections
- A generalization of Kneser graphs
- Exact distance graphs of product graphs
- On the chromatic number of generalized Kneser hypergraphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Independence numbers and chromatic numbers of some distance graphs
- Closed k-stop distance in graphs
- On chromatic numbers of nearly Kneser distance graphs
- Extremal problems in hypergraph colourings
This page was built for publication: On chromatic numbers of close-to-Kneser distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364457)
