Extremal $K_4$-minor-free graphs without short cycles
| Autor: | Bar��t, J��nos |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| DOI: | 10.48550/arxiv.2111.05712 |
| Popis: | 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. to appear in Periodica Mathematica Hungarica |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|