Independence numbers of Johnson-type graphs

DOI10.1007/s00574-023-00350-yzbMath1518.05186arXiv1907.06752OpenAlexW2961195811MaRDI QIDQ6115445

Sergei Kiselev, Danila Cherkashin

Publication date: 12 July 2023

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.06752

zbMATH Keywords

independence numberdistance graphsintersecting familiesErdös-Ko-Rado theorem

Mathematics Subject Classification ID

Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On hypergraph cliques with chromatic number 3
• Uniform eventown problems
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• The complete intersection theorem for systems of finite sets
• Kneser's conjecture, chromatic number, and homotopy
• On a packing and covering problem
• Forbidding just one intersection
• More-than-nearly-perfect packings and partial designs
• Intersection theorems with geometric consequences
• On the ratio of optimal integral and fractional covers
• On the difference between asymptotically good packings and coverings
• A fast algorithm for the maximum clique problem
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Chromatic numbers of Kneser-type graphs
• Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring some finite sets in {R}^{n}
• A counterexample to Borsuk’s conjecture
• Families of vectors without Antipodal pairs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the chromatic number of a space
• A Stability Result for Families with Fixed Diameter
• On a combinatorial conjecture of Erdös
• The realization of distances within sets in Euclidean space
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: Independence numbers of Johnson-type graphs