Paths are Turán-good

DOI10.1007/S00373-023-02641-ZzbMath1514.05083arXiv2204.07638MaRDI QIDQ6045138

Dániel Gerbner

Publication date: 26 May 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.07638

zbMATH Keywords

generalized Turán pathTurán-good path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (3)

Generalized Turán results for intersecting cliques ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ Every graph is eventually Turán-good

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Some results on \(k\)-Turán-good graphs
• Paths of length three are \(K_{r+1}\)-Turán-good
• Some exact results for generalized Turán problems
• Some exact results of the generalized Turán numbers for paths

This page was built for publication: Paths are Turán-good