Orthogonal polarity graphs and Sidon sets

From MaRDI portal
Publication:2811198

DOI10.1002/JGT.21890zbMATH Open1339.05201arXiv1403.4489OpenAlexW2591824444MaRDI QIDQ2811198FDOQ2811198


Authors: Michael Tait, Craig Timmons Edit this on Wikidata


Publication date: 10 June 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: Determining the maximum number of edges in an n-vertex C4-free graph is a well-studied problem that dates back to a paper of ErdH{o}s from 1938. One of the most important families of C4-free graphs are the ErdH{o}s-R'enyi orthogonal polarity graphs. We show that the Cayley sum graph constructed using a Bose-Chowla Sidon set is isomorphic to a large induced subgraph of the ErdH{o}s-R'enyi orthogonal polarity graph. Using this isomorphism we prove that the Petersen graph is a subgraph of every sufficiently large ErdH{o}s-R'enyi orthogonal polarity graph.


Full work available at URL: https://arxiv.org/abs/1403.4489




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Orthogonal polarity graphs and Sidon sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811198)