Some exact results of the generalized Turán numbers for paths

DOI10.1016/j.ejc.2022.103682OpenAlexW4313576128MaRDI QIDQ2700989

Doudou Hei, Xin Min Hou, Boyuan Liu

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberTurán graphTurán-good

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) 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 for non-degenerate generalized Turán problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Some sharp results on the generalized Turán numbers
• On Turán-good 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
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• A note on the maximum number of triangles in a C₅‐free graph
• A Generalized Turán Problem and its Applications
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Some exact results of the generalized Turán numbers for paths