English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $\Gamma$ be the graph whose vertices are the chambers of the finiteprojective space $PG(3,q)$ with two vertices being adjacent when thecorresponding chambers are in general position. It is known that theindependence number of this graph is $(q^2+q+1)(q+1)^2$. For $q\ge 43$ wedetermine the largest independent set of $\Gamma$ and show that every maximalindependent set that is not a largest one has at most constant times $q^3$elements. For $q\ge 47$, this information is then used to show that $\Gamma$has chromatic number $q^2+q$. Furthermore, for many families of generalizedquadrangles we prove similar results for the graph that is built in the sameway on the chambers of the generalized quadrangle.

The chromatic number of a two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces