45 citations · 53 across the 5 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 45 cited
Extremal numbers for odd cycles
Zoltan Füredi, David S. Gunderson
We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1})…
math.CO2013★ 5 cited
Cycle-maximal triangle-free graphs
Stephane Durocher, David S. Gunderson, Pak Ching Li +1
We conjecture that the balanced complete bipartite graph contains more cycles than any other -vertex triangle-free graph, and we make…