Bounds on Borsuk numbers in distance graphs of a special type

DOI10.1134/S0032946021020034MaRDI QIDQ2044127zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

\((0, 1)\)-vectorsBorsuk's problemcoloringsdiameter graphspartitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) General theory of distance geometry (51K05)

Recommendations

• On Borsuk's conjecture for two-distance sets
• On a bound in Borsuk's problem
• A counterexample to Borsuk’s conjecture
• Around Borsuk's hypothesis
• Sets with large Borsuk number

Cites work

• A generalization of Kneser graphs
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
• Borsuk's problem and the chromatic numbers of some metric spaces
• Chromatic numbers of Kneser-type graphs
• Chromatic numbers of some distance graphs
• Combinatorial geometry and coding theory
• Counterexamples to Borsuk's conjecture with large girth
• Degree versions of theorems on intersecting families via stability
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Estimate of the number of edges in special subgraphs of a distance graph
• scientific article; zbMATH DE number 6381834 (Why is no real title available?)
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 177380 (Why is no real title available?)
• Illuminating sets of constant width
• Incompatible intersection properties
• Modularity of some distance graphs
• New bounds on clique-chromatic numbers of Johnson graphs
• On a bound in extremal combinatorics
• On a Frankl-Wilson theorem
• On rational analogs of Nelson-Hadwiger's and Borsuk's problems
• On the chromatic numbers of some distance graphs
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• Regular intersecting families
• The difference between consecutive primes. II

Cited in

(17)

• New sets with large Borsuk numbers
• New Turán type bounds for Johnson graphs
• 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
• Borsuk number for planar convex bodies
• Counterexamples to Borsuk's conjecture with large girth
• Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
• scientific article; zbMATH DE number 2070003 (Why is no real title available?)
• The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products
• scientific article; zbMATH DE number 1775058 (Why is no real title available?)
• Covering planar sets
• Lower bound on the minimum number of edges in subgraphs of Johnson graphs
• Counterexamples to Borsuk's conjecture on spheres of small radius
• Some analogues of the Borsuk problem in \(\mathbb Q^{n}\)
• Block partitions: an extended view
• Optimal partitions of the flat torus into parts of smaller diameter

This page was built for publication: Bounds on Borsuk numbers in distance graphs of a special type

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044127)