On the number of star‐shaped classes in optimal colorings of Kneser graphs

DOI10.1002/jgt.23032arXiv2201.05605OpenAlexW4387013725MaRDI QIDQ6143383

Hamid Reza Daneshpajouh

Publication date: 24 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

line graphchromatic numberKneser graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the chromatic number of general Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• A certain combinatorial inequality
• Short proofs of the Kneser-Lovász coloring principle
• New construction of graphs with high chromatic number and small clique number
• A combinatorical proof of Kneser's conjecture
• On the chromatic number of generalized Kneser hypergraphs
• Strengthening topological colorful results for graphs
• Colorful subgraphs in Kneser-like graphs
• On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs
• Hedetniemi's conjecture from the topological viewpoint
• Intersection patterns of finite sets and of convex sets
• The Chromatic Number of Kneser Hypergraphs
• A New Short Proof of Kneser's Conjecture
• Colorings of complements of line graphs

This page was built for publication: On the number of star‐shaped classes in optimal colorings of Kneser graphs