Loading…
Extremal \(K_4\)-minor-free graphs without short cycles
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.
Saved in:
Published in: | arXiv.org 2021-11 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 2331-8422 |