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

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

doi:10.1016/j.jctb.2024.01.005

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

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We resolve a conjecture of Cox and Martin by determining asymptotically for every k≥2 the maximum number of copies of C_2k in an n-vertex planar graph.

Original language	English
Pages (from-to)	15-22
Number of pages	8
Journal	Journal of Combinatorial Theory. Series B
Volume	167
DOIs	https://doi.org/10.1016/j.jctb.2024.01.005
State	Published - Jul 2024

Bibliographical note

Publisher Copyright:
© 2024 Elsevier Inc.

Keywords

Even cycles
Extremal
Planar graphs

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/j.jctb.2024.01.005

Cite this

@article{cd953cedea2d47eab5f8312683fa67bb,

title = "The maximum number of copies of an even cycle in a planar graph",

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.",

keywords = "Even cycles, Extremal, Planar graphs",

author = "Zequn Lv and Ervin Gy{\H o}ri and Zhen He and Nika Salia and Casey Tompkins and Xiutao Zhu",

note = "Publisher Copyright: {\textcopyright} 2024 Elsevier Inc.",

year = "2024",

month = jul,

doi = "10.1016/j.jctb.2024.01.005",

language = "English",

volume = "167",

pages = "15--22",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

}

TY - JOUR

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

AU - Lv, Zequn

AU - Győri, Ervin

AU - He, Zhen

AU - Salia, Nika

AU - Tompkins, Casey

AU - Zhu, Xiutao

PY - 2024/7

Y1 - 2024/7

N2 - 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.

AB - 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.

KW - Even cycles

KW - Extremal

KW - Planar graphs

UR - https://www.scopus.com/pages/publications/85185794389

U2 - 10.1016/j.jctb.2024.01.005

DO - 10.1016/j.jctb.2024.01.005

M3 - Article

AN - SCOPUS:85185794389

SN - 0095-8956

VL - 167

SP - 15

EP - 22

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this