Small snarks with large oddness
Robert Lukotka, Edita Macajova, Jan Mazak, Martin Skoviera

TL;DR
This paper investigates the minimum size of cubic graphs with specified oddness and cyclic connectivity, providing new bounds and constructions for snarks with large oddness ratios and specific connectivity properties.
Contribution
It establishes lower bounds on the number of vertices for cubic graphs with given oddness and cyclic connectivity, and constructs new examples of snarks with improved parameters.
Findings
Lower bound of 5.41 times oddness on vertices for certain cubic graphs
Improved upper bounds on oddness ratios for cyclic connectivity 2, 4, 5, 6
Constructed a cyclically 4-connected snark with girth 5 and oddness 4 on 44 vertices
Abstract
We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph with oddness other than the Petersen graph has at least vertices, and for each integer with we construct an infinite family of cubic graphs with cyclic connectivity and small oddness ratio . In particular, for cyclic connectivity 2, 4, 5, and 6 we improve the upper bounds on the oddness ratio of snarks to 7.5, 13, 25, and 99 from the known values 9, 15, 76, and 118, respectively. In addition, we construct a cyclically 4-connected snark of girth 5 with oddness 4 on 44 vertices, improving the best previous value of 46.
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.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Graph theory and applications
