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

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2024-02-22 DOI:10.1016/j.jctb.2024.01.005

Zequn Lv , Ervin Győri , Zhen He , Nika Salia , Casey Tompkins , Xiutao Zhu

引用次数: 0

Abstract

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k \geq 2$ the maximum number of copies of $C_{2 k}$ in an n-vertex planar graph.

查看原文本刊更多论文

平面图中偶数循环的最大份数

我们解决了考克斯和马丁的一个猜想，即在 n 个顶点的平面图中，渐近地确定每 k≥2 个顶点的 C2k 的最大副本数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.