Lv, Zequn and Győri, Ervin and He, Zhen and Salia, Nika and Tompkins, Casey and Zhu, Xiutao (2024) The maximum number of copies of an even cycle in a planar graph. JOURNAL OF COMBINATORIAL THEORY SERIES B, 167. pp. 15-22. ISSN 0095-8956
|
Text
2205.15810v21.pdf Available under License Creative Commons Attribution. Download (110kB) | Preview |
Official URL: https://doi.org/10.1016/j.jctb.2024.01.005
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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:29 |
| Last Modified: | 05 Apr 2024 11:29 |
| URI: | https://real.mtak.hu/id/eprint/191954 |
Actions (login required)
 |
Edit Item |
