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

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research 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

摘要

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

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

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.