Examples of diameter-2 graphs with no triangle or $K_{2,t}$
Sean Eberhard, Vladislav Taranchuk, and Craig Timmons

TL;DR
This paper constructs infinite families of diameter-2 graphs without triangles or certain bipartite subgraphs, disproving the conjecture that such classes are finite for all t.
Contribution
It demonstrates that for t=3, 5, and 7, the classes of graphs are infinite, providing new examples and counterexamples to previous conjectures.
Findings
W_3 is infinite, with examples based on crooked graphs.
W_5 contains infinitely many regular graphs.
W_7 includes infinitely many Cayley graphs.
Abstract
For each let denote the class of graphs other than stars that have diameter and contain neither a triangle nor a . The famous Hoffman--Singleton Theorem implies that is finite. Recently Wood suggested the study of for and conjectured that is finite for all . In this note we show that (1) is infinite, (2) contains infinitely many regular graphs, and (3) contains infinitely many Cayley graphs. Our and examples are based on so-called crooked graphs, first constructed by de Caen, Mathon, and Moorhouse. Our examples are Cayley graphs with vertex set for prime .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
