On the Chromatic Number of the Erdős-Rényi Orthogonal Polarity Graph

Xing Peng, Michael Tait, Craig Timmons


For a prime power $q$, let $ER_q$ denote the Erdős-Rényi orthogonal polarity graph. We prove that if $q$ is an even power of an odd prime, then $\chi ( ER_{q}) \leq 2 \sqrt{q} + O ( \sqrt{q} / \log q)$. This upper bound is best possible up to a constant factor of at most 2. If $q$ is an odd power of an odd prime and satisfies some condition on irreducible polynomials, then we improve the best known upper bound for $\chi(ER_{q})$ substantially. We also show that for sufficiently large $q$, every $ER_q$ contains a subgraph that is not 3-chromatic and has at most 36 vertices.


Orthogonal polarity graphs, Turán number, Forbidden subgraph, chromatic number

Full Text: PDF