Independence numbers and chromatic numbers of some distance graphs
type: Item
instance of: scholarly article
title: Independence numbers and chromatic numbers of some distance graphs
zbMATH Open document ID: 1332.05050
DOI: 10.1134/S0032946015020076
author: Andrei V. Bobu
author: Aleksandr È. Kupriyanov
author: Olga A. Kostina
published in: Problems of Information Transmission
publication date: 2016-03-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6558238
zbMATH Keywords: upper bounds on chromatic numbers
zbMATH Keywords: independence sets
MaRDI profile type: Publication
cites work: Borsuk's problem and the chromatic numbers of some metric spaces
cites work: Coloring Distance Graphs and Graphs of Diameters
cites work: Research Problems in Discrete Geometry
cites work: The Mathematical Coloring Book
cites work: On the chromatic numbers of spheres in Euclidean spaces
cites work: On the chromatic numbers of spheres in \(\mathbb R^n\)
cites work: Q4339095
cites work: A counterexample to Borsuk’s conjecture
cites work: On the chromatic number of a space
cites work: The realization of distances within sets in Euclidean space
cites work: Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
cites work: Coloring some finite sets in \(\mathbb R^n\)
cites work: Intersection theorems with geometric consequences
cites work: Around Borsuk's hypothesis
cites work: Q5301263
cites work: The Borsuk partition problem: the seventieth anniversary
cites work: Q4146667
cites work: Q4542184
cites work: The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
cites work: Q4463737
cites work: Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
cites work: The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
cites work: The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
cites work: The problems of Borsuk and Grunbaum on lattice polytopes
cites work: The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
cites work: Forbidding just one intersection
cites work: 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
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Lectures on advances in combinatorics
cites work: The complete nontrivial-intersection theorem for systems of finite sets
cites work: The complete intersection theorem for systems of finite sets
cites work: Kneser's conjecture, chromatic number, and homotopy
cites work: Q3781767
cites work: What we know and what we do not know about Turán numbers
cites work: On a packing and covering problem
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
full work available at URL: s0032946015020076
OpenAlex ID: W2261895830
description: scientific article; zbMATH DE number 6558238