The chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of its incidence graph, via an elementary matching argument in symmetric designs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces clique graphs on graphs with unique ω-clique edge covers and derives spectral bounds, strongly regular classifications, and applications to existence questions.
citing papers explorer
-
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
The chromatic number of the Kneser graph on chambers of a projective plane equals the incidence-free number of its incidence graph, via an elementary matching argument in symmetric designs.
-
A Comprehensive Study of Clique Graphs and Clique Regular Graphs
Introduces clique graphs on graphs with unique ω-clique edge covers and derives spectral bounds, strongly regular classifications, and applications to existence questions.