On the chromatic number of the general Kneser-graph
From MaRDI portal
Publication:3691691
DOI10.1002/jgt.3190090204zbMath0574.05022OpenAlexW2088127311MaRDI QIDQ3691691
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090204
Related Items (11)
Large cycles in generalized Johnson graphs ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Shifts of the stable Kneser graphs and hom-idempotence ⋮ Circular coloring and Mycielski construction ⋮ Chromatic number via Turán number ⋮ The Chromatic Number of Kneser Hypergraphs ⋮ On the chromatic number of generalized Kneser graphs and Hadamard matrices ⋮ Large disjoint subgraphs with the same order and size ⋮ Extremal problems concerning Kneser-graphs ⋮ Covering radius and the chromatic number of Kneser graphs
Cites Work
This page was built for publication: On the chromatic number of the general Kneser-graph
