Some results on k-Turán-good graphs

DOI10.1016/J.DISC.2021.112509zbMATH Open1467.05126arXiv2102.01332OpenAlexW3170672095MaRDI QIDQ2037585FDOQ2037585

Authors: Bingchen Qian, Chengfei Xie, Gennian Ge 

Publication date: 8 July 2021

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

Abstract: For a graph $H$ and a $k$-chromatic graph $F,$ if the Tur'an graph $T_{k-1}(n)$ has the maximum number of copies of $H$ among all $n$-vertex $F$-free graphs (for $n$ large enough), then $H$ is called $F$-Tur'an-good, or $k$-Tur'an-good for short if $F$ is $K_k.$ In this paper, we construct some new classes of $k$-Tur'an-good graphs and prove that $P_4$ and $P_5$ are $k$-Tur'an-good for $kge4.$

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

Recommendations

• Some exact results for generalized Turán problems
• On Turán-good graphs
• Some sharp results on the generalized Turán numbers
• Some exact results of the generalized Turán numbers for paths
• Paths of length three are \(K_{r+1}\)-Turán-good

zbMATH Keywords

pathsTurán graphTurán-good

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Some exact results for generalized Turán problems
• Some exact results of the generalized Turán numbers for paths
• Paths are Turán-good
• On Turán-good graphs
• Paths of length three are \(K_{r+1}\)-Turán-good
• Every graph is eventually Turán-good
• On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
• The cycle of length four is strictly \(F\)-Turán-good

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037585)