Abstract
We consider a restriction of the well-known Cage Problem to the class of vertex-transitive graphs, and consider the problem of finding the smallest vertex-transitive k-regular graphs of girth g. Counting cycles to obtain necessary arithmetic conditions on the parameters (k,g), we extend previous results of Biggs, and prove that, for any given excess e and any given degree k≥4, the asymptotic density of the set of girths g for which there exists a vertex-transitive (k,g)-cage with excess not exceeding e is 0.
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.
