Lower bounds for the independence numbers of distance graphs with vertices in \-1,0,1\^n
From MaRDI portal
Publication:6918368
Cites work
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Extremal problems and coverings of the space
- Families of vectors without antipodal pairs
- Forbidding just one intersection
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 3458659 (Why is no real title available?)
- scientific article; zbMATH DE number 3523543 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3098608 (Why is no real title available?)
- Independence numbers of Johnson-type graphs
- Intersection theorems for \((- 1, 0, 1)\)-vectors
- Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
- Intersection theorems with geometric consequences
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Lectures on advances in combinatorics
- Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
- 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
- On a packing and covering problem
- 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
- On the chromatic number of a space
- On the chromatic number of an infinitesimal plane layer
- On the chromatic numbers of small-dimensional Euclidean spaces
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
- Research Problems in Discrete Geometry
- The chromatic number of the plane is at least 5
- The chromatic number of the plane is at least 5: a new proof
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
- The Mathematical Coloring Book
- The realization of distances within sets in Euclidean space
- Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
This page was built for publication: Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918368)
