On the chromatic number of the Erdős-Rényi orthogonal polarity graph
From MaRDI portal
Publication:2344823
zbMath1312.05053arXiv1408.4065MaRDI QIDQ2344823
Craig Timmons, Michael Tait, Xing Peng
Publication date: 18 May 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4065
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The independence number for polarity graphs of even order planes
- Turán numbers of bipartite graphs plus an odd cycle
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- Eigenvalue bounds for independent sets
- Some constructive bounds on Ramsey numbers
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- On hypergraphs of girth five
- Coloring graphs with sparse neighborhoods
- Graphs without quadrilaterals
- On the number of edges of quadrilateral-free graphs
- Combinatorial problems in finite fields and Sidon sets
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- On Graphs that do not Contain a Thomsen Graph