Abstract
For a prime power , let denote the Erdős-Rényi orthogonal polarity graph. We prove that if is an even power of an odd prime, then . This upper bound is best possible up to a constant factor of at most 2. If is an odd power of an odd prime and satisfies some condition on irreducible polynomials, then we improve the best known upper bound for substantially. We also show that for sufficiently large , every contains a subgraph that is not 3-chromatic and has at most 36 vertices.
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.