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
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The thesis proposes specialized algebraic, logical, and geometric methods to enable scalable reasoning over imprecise attributes, probabilistic triples, and incomplete schemas in knowledge graphs.
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.
-
Scalable Uncertainty Reasoning in Knowledge Graphs
The thesis proposes specialized algebraic, logical, and geometric methods to enable scalable reasoning over imprecise attributes, probabilistic triples, and incomplete schemas in knowledge graphs.