The maximum number of copies of an even cycle in a planar graph

preprint2022arXivOpen access

Abstract

We resolve a conjecture of Cox and Martin by determining asymptotically for every k≥2k\ge 2 the maximum number of copies of C2kC_{2k} in an nn-vertex planar graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.