Abstract
AbstractDetermining the maximum number of edges in an n‐vertex C4‐free graph is a well‐studied problem that dates back to a paper of Erdős from 1938. One of the most important families of C4‐free graphs are the Erdős‐Rényi 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 Erdős‐Rényi orthogonal polarity graph. Using this isomorphism, we prove that the Petersen graph is a subgraph of every sufficiently large Erdős‐Rényi orthogonal polarity graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
