Flexible $3$-valent graphs of even girth
Marco Barbieri, Andoni Zozaya

TL;DR
This paper proves the existence of connected, flexible, 3-valent, vertex-transitive graphs with even girth for all integers, providing a constructive method for prime girth lengths.
Contribution
It establishes the existence of such graphs for all even girths and offers a constructive proof specifically for prime girth lengths.
Findings
Existence of connected flexible 3-valent vertex-transitive graphs for all even girths.
Constructive proof provided for prime girth lengths.
Applicable to all integers with even girth.
Abstract
We prove the existence of a connected flexible -valent vertex-transitive graph of girth for every integer . We also give a constructive proof if is 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.
