Abstract
Let be the graph whose vertices are the chambers of the finite projective space with two vertices being adjacent when the corresponding chambers are in general position. It is known that the independence number of this graph is . For we determine the largest independent set of and show that every maximal independent set that is not a largest one has at most constant times elements. For , this information is then used to show that has chromatic number . Furthermore, for many families of generalized quadrangles we prove similar results for the graph that is built in the same way on the chambers of the generalized quadrangle.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.