Trivial colors in colorings of Kneser graphs

DOI10.1016/j.disc.2023.113869arXiv2012.14528OpenAlexW3115481408WikidataQ129111530 ScholiaQ129111530MaRDI QIDQ6197737

Sergei Kiselev, Andrey B. Kupavskii

Publication date: 19 February 2024

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

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

zbMATH Keywords

Kneser graphsnon-trivial intersecting familiesKneser colorings

Mathematics Subject Classification ID

Graph theory (05Cxx) Enumerative combinatorics (05Axx) Extremal combinatorics (05Dxx)

Cites Work

• Unnamed Item
• The clique density theorem
• Kneser's conjecture, chromatic number, and homotopy
• Extremal problems concerning Kneser-graphs
• Covering by intersecting families
• Sharp bounds for the chromatic number of random Kneser graphs
• The Erdős matching conjecture and concentration inequalities
• Turan's theorem for \(k\)-graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the union of intersecting families
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Trivial colors in colorings of Kneser graphs