Bounds on Borsuk numbers in distance graphs of a special type
From MaRDI portal
Publication:2044127
DOI10.1134/S0032946021020034zbMath1470.05021OpenAlexW3180304416MaRDI QIDQ2044127
Alexey V. Berdnikov, Andrei M. Raigorodskii
Publication date: 4 August 2021
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946021020034
Partitions of sets (05A18) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) General theory of distance geometry (51K05)
Related Items (6)
On Ramsey numbers for arbitrary sequences of graphs ⋮ On the minimal number of edges in induced subgraphs of special distance graphs ⋮ Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ Lower bound on the minimum number of edges in subgraphs of Johnson graphs ⋮ Covering planar sets ⋮ New Turán type bounds for Johnson graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a bound in extremal combinatorics
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- On the chromatic numbers of some distance graphs
- On a Frankl-Wilson theorem
- Chromatic numbers of some distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- A generalization of Kneser graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- Modularity of some distance graphs
- Chromatic numbers of Kneser-type graphs
- Incompatible intersection properties
- 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 \(\ell_1\) and \(\ell_2\)
- Degree versions of theorems on intersecting families via stability
- Regular intersecting families
- Counterexamples to Borsuk's conjecture with large girth
- The Difference Between Consecutive Primes, II
- Borsuk's problem and the chromatic numbers of some metric spaces
- Illuminating sets of constant width
- Combinatorial Geometry and Coding Theory*
- О рациональных аналогах проблем Нелсона - Хадвигера
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: Bounds on Borsuk numbers in distance graphs of a special type
