On chromatic numbers of close-to-Kneser distance graphs
From MaRDI portal
Publication:2364457
DOI10.1134/S0032946016040050zbMath1367.05065MaRDI QIDQ2364457
Publication date: 21 July 2017
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (6)
On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ A generalization of Kneser graphs ⋮ Extremal problems in hypergraph colourings ⋮ Exact distance graphs of product graphs ⋮ On the chromatic number of generalized Kneser hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence numbers and chromatic numbers of some distance graphs
- Lovász' theorem on the chromatic number of spheres revisited
- 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
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Intersection theorems with geometric consequences
- The complete nontrivial-intersection theorem for systems of finite sets
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- Borsuk's problem and the chromatic numbers of some metric spaces
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Coloring Distance Graphs and Graphs of Diameters
- Coloring some finite sets in {R}^{n}
- Research Problems in Discrete Geometry
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Forbidden Intersections
- On the chromatic number of a space with forbidden equilateral triangle
- 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
This page was built for publication: On chromatic numbers of close-to-Kneser distance graphs
