New upper bounds for the independence numbers of graphs with vertices in \-1,0,1\^n and their applications to problems of the chromatic numbers of distance graphs

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

Cites work

A counterexample to Borsuk’s conjecture
An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
Borsuk's problem and the chromatic numbers of some metric spaces
Codes with forbidden distances
Coloring distance graphs and graphs of diameters
Counterexamples to Borsuk's conjecture on spheres of small radius
scientific article; zbMATH DE number 5935733 (Why is no real title available?)
scientific article; zbMATH DE number 51916 (Why is no real title available?)
scientific article; zbMATH DE number 1017008 (Why is no real title available?)
scientific article; zbMATH DE number 1943977 (Why is no real title available?)
scientific article; zbMATH DE number 2070003 (Why is no real title available?)
scientific article; zbMATH DE number 3068973 (Why is no real title available?)
Intersection theorems with geometric consequences
Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
On a bound in Borsuk's problem
On the chromatic number of a space
On the chromatic numbers of spheres in \(\mathbb R^n\)
On the chromatic numbers of spheres in Euclidean spaces
On the dimension in Borsuk's problem
On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
Research Problems in Discrete Geometry
The Borsuk problem for (0,1)-polyhedra and cross polytopes.
The Mathematical Coloring Book
The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
The problems of Borsuk and Grunbaum on lattice polytopes
The realization of distances within sets in Euclidean space
Three lectures on the Borsuk partition problem

Cited in

(11)

Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
On the chromatic numbers of some distance graphs
On the number of edges of a uniform hypergraph with a range of allowed intersections
A generalization of Kneser graphs
On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
On lower bounds for the chromatic number of spheres
Turán-type results for distance graphs in an infinitesimal plane layer
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
Intersection theorems for \((- 1, 0, 1)\)-vectors
Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
An exact result for (0, 1)-vectors

This page was built for publication: New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2342346)