Some results on \(k\)-Turán-good graphs

DOI10.1016/J.DISC.2021.112509zbMath1467.05126arXiv2102.01332OpenAlexW3170672095MaRDI QIDQ2037585

Gennian Ge, Bingchen Qian, Chengfei Xie

Publication date: 8 July 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

pathsTurán graphTurán-good

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Paths are Turán-good ⋮ The cycle of length four is strictly \(F\)-Turán-good ⋮ Some exact results of the generalized Turán numbers for paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Some sharp results on the generalized Turán numbers
• On Turán-good graphs
• Paths of length three are \(K_{r+1}\)-Turán-good
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Generalized Turán problems for disjoint copies of graphs
• A Generalized Turán Problem and its Applications
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Some results on \(k\)-Turán-good graphs