论文标题
平面图中均匀周期的最大副本数量
The maximum number of copies of an even cycle in a planar graph
论文作者
论文摘要
我们通过每$ k \ ge 2 $渐近地确定$ c_ {2k} $的最大副本数量在$ n $ - vertex planar graph中，解决了Cox和Martin的猜想。
We resolve a conjecture of Cox and Martin by determining asymptotically for every $k\ge 2$ the maximum number of copies of $C_{2k}$ in an $n$-vertex planar graph.
