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
From MaRDI portal
Publication:2452861
Recommendations
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
- The connection between the Borsuk and Erdös-Hadwiger problems
- Independence numbers and chromatic numbers of some distance graphs
- On the Borsuk and Erdős-Hadwiger numbers
Cites work
- A counterexample to Borsuk’s conjecture
- A note on asymptotic control theory
- Borsuk's problem and the chromatic numbers of some metric spaces
- Erdös–Ko–Rado Theorem—22 Years Later
- Excursions into combinatorial geometry
- Forbidden Intersections
- scientific article; zbMATH DE number 3831189 (Why is no real title available?)
- scientific article; zbMATH DE number 4043856 (Why is no real title available?)
- scientific article; zbMATH DE number 51916 (Why is no real title available?)
- scientific article; zbMATH DE number 177380 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 865987 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- scientific article; zbMATH DE number 5496873 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- scientific article; zbMATH DE number 3098608 (Why is no real title available?)
- Illuminating sets of constant width
- Intersection theorems with geometric consequences
- Lectures on advances in combinatorics
- On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
- On lower bounds for Borsuk and Hadwiger numbers
- On Ramsey Type Problems in Combinatorial Geometry
- On the Borsuk and Erdős-Hadwiger numbers
- On the chromatic number of a space
- On the chromatic number of Euclidean space and the Borsuk problem
- On the chromatic number of real and rational spaces
- On the chromatic numbers of metric spaces with few forbidden distances
- On the dimension in Borsuk's problem
- The Borsuk partition problem: the seventieth anniversary
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The realization of distances within sets in Euclidean space
- Three lectures on the Borsuk partition problem
Cited in
(9)- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- On the measurable chromatic number of a space of dimension \(n \leq 24\)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Combinatorial geometry and coding theory
- On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
- On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
- Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452861)
