On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
From MaRDI portal
Publication:2313252
DOI10.1134/S1064562419020194zbMath1415.05137OpenAlexW2953230194MaRDI QIDQ2313252
E. D. Shishunov, Andrei M. Raigorodskii
Publication date: 18 July 2019
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562419020194
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (14)
On a Frankl-Wilson theorem ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ Intersection theorems for \((- 1, 0, 1)\)-vectors ⋮ New lower bound on the modularity of Johnson graphs ⋮ On stability of the independence number of a certain distance graph ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ On dividing sets into parts of smaller diameter ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ Modularity of some distance graphs ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
Cites Work
- Families of sets with no matchings of sizes 3 and 4
- On a bound in extremal combinatorics
- Diversity of uniform intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Regular bipartite graphs and intersecting families
- New inequalities for families without \(k\) pairwise disjoint members
- Coloring cross-intersecting families
- On the chromatic numbers of low-dimensional spaces
- Improvements of the Frankl-Rödl theorem and geometric consequences
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Counting Intersecting and Pairs of Cross-Intersecting Families
- Combinatorial Geometry and Coding Theory*
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
