Cycle-maximal triangle-free graphs


We conjecture that the balanced complete bipartite graph K⌊n/2⌋,⌈n/2⌉ contains more cycles than any other n-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and… (More)
DOI: 10.1016/j.disc.2014.10.002


8 Figures and Tables

Slides referencing similar topics