The maximum number of copies of an even cycle in a planar graph
Abstract
We resolve a conjecture of Cox and Martin by determining asymptotically for every k 2 the maximum number of copies of C2k in an n-vertex planar graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.