On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)

DOI10.1134/S1064562419050193zbMath1434.05115OpenAlexW4251680017MaRDI QIDQ2304365

E. D. Shishunov, Andrei M. Raigorodskii

Publication date: 11 March 2020

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562419050193

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Families of sets with no matchings of sizes 3 and 4
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On lower bounds for the chromatic number of spheres
• Clique chromatic numbers of intersection graphs
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• The number of edges in induced subgraphs of some distance graphs
• On small \(n\)-uniform hypergraphs with positive discrepancy
• On the chromatic numbers of low-dimensional spaces
• Panchromatic 3-colorings of random hypergraphs
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Turán-type results for distance graphs in an infinitesimal plane layer
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space
• Partition‐free families of sets
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)