Independence numbers and chromatic numbers of some distance graphs

DOI10.1134/S0032946015020076zbMATH Open1332.05050OpenAlexW2261895830MaRDI QIDQ259909FDOQ259909

Authors: Andrei V. Bobu, Aleksandr È. 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

Recommendations

• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• On chromatic numbers of close-to-Kneser distance graphs
• The chromatic numbers of distance graphs
• On chromatic numbers of nearly Kneser distance graphs

zbMATH Keywords

independence setsupper bounds on chromatic numbers

Mathematics Subject Classification ID

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

Cites Work

• Research Problems in Discrete Geometry
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• 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
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring distance graphs and graphs of diameters
• Coloring some finite sets in \(\mathbb R^n\)
• A counterexample to Borsuk’s conjecture
• The problems of Borsuk and Grunbaum on lattice polytopes
• The Mathematical Coloring Book
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the chromatic number of a space
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Title not available (Why is that?)
• Three lectures on the Borsuk partition problem
• 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
• 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

Cited In (20)

• Distance independence polynomial of graphs
• On chromatic numbers of close-to-Kneser distance graphs
• On the number of edges in a uniform hypergraph with a range of permitted intersections
• Chromatic numbers of Kneser-type graphs
• On the number of edges of a uniform hypergraph with a range of allowed intersections
• 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
• Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
• Independence and chromatic densities of graphs
• Hasse diagrams with large chromatic number
• On the independence ratio of distance graphs
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• Independence number and packing coloring of generalized Mycielski graphs
• On the structure of distance graphs with a large chromatic number
• Modularity of some distance graphs
• Turán-type bounds for distance graphs
• Turán-type results for distance graphs in an infinitesimal plane layer
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Independence numbers of Johnson-type graphs
• Chromatic numbers of some distance graphs
• Chromatic number, independence ratio, and crossing number

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)