12 citations · 71 across the 46 of their papers we have counts for
4 papers · 2 filters
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…
On Coupon Colorings of Graphs
Bob Chen, Jeong Han Kim, Michael Tait +1
Let be a graph with no isolated vertices. A {\em -coupon coloring} of is an assignment of colors from to the vertices of such that the neigh…
On sets of integers with restrictions on their products
Michael Tait, Jacques Verstraete
A {\em product-injective labeling} of a graph is an injection such that for any distinct edges . Let b…
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…