Extremal K4-minor-free graphs without short cycles

被引：0

作者：

Barat, Janos ^{[1
,2
]}

机构：

[1] Eotvos Lorand Res Network, Alfred Renyi Inst Math, Budapest, Hungary

[2] Univ Pannonia, Dept Math, Veszprem, Hungary

来源：

PERIODICA MATHEMATICA HUNGARICA | 2023年 / 86卷 / 01期

关键词：

Extremal graph; K-4-minor-free; Girth; Euler's formula; Graph decomposition;

D O I：

10.1007/s10998-022-00465-7

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We determine the maximum number of edges in a K-4-minor-free n-vertex graph of girth g, when g = 5 or g is even. We argue that there are many different n-vertex extremal graphs if n is even and g is odd.

引用

页码：108 / 114

页数：7