Independence numbers and chromatic numbers of some distance graphs

DOI10.1134/S0032946015020076zbMath1332.05050OpenAlexW2261895830MaRDI QIDQ259909

A. V. Bobu, A. E. Kupriyanov, Olga A. Kostina

Publication date: 18 March 2016

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946015020076

zbMATH Keywords

independence setsupper bounds on chromatic numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On chromatic numbers of close-to-Kneser distance graphs ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of some distance graphs ⋮ Chromatic numbers of Kneser-type graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On the chromatic numbers of spheres in Euclidean spaces
• The complete intersection theorem for systems of finite sets
• Kneser's conjecture, chromatic number, and homotopy
• Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
• The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
• Lectures on advances in combinatorics
• On a packing and covering problem
• Forbidding just one intersection
• Intersection theorems with geometric consequences
• The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
• The Borsuk partition problem: the seventieth anniversary
• What we know and what we do not know about Turán numbers
• The complete nontrivial-intersection theorem for systems of finite sets
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Around Borsuk's hypothesis
• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• 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}
• A counterexample to Borsuk’s conjecture
• Research Problems in Discrete Geometry
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The problems of Borsuk and Grunbaum on lattice polytopes
• The Mathematical Coloring Book
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
• 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: Independence numbers and chromatic numbers of some distance graphs