3 citations · 11 across the 28 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
On the chromatic number of the Erdős-Rényi orthogonal polarity graph
Xing Peng, Mike Tait, Craig Timmons
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 $χ( ER_{q}) \leq 2 \sqrt{q} + O ( \s…
math.CO2014
Orthogonal polarity graphs and Sidon sets
Michael Tait, Craig Timmons
Determining the maximum number of edges in an -vertex -free graph is a well-studied problem that dates back to a paper of Erdős from 1938. One of the most important familie…