Paths of length three are \(K_{r+1}\)-Turán-good

DOI10.37236/10225zbMath1486.05148arXiv2102.00323OpenAlexW4205569143MaRDI QIDQ2121716

JD Nir, Kyle Murphy

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

flag algebrageneralized Turán problem\(P_3\)F-Turán good

Mathematics Subject Classification ID

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

Related Items

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, Some exact results of the generalized Turán numbers for paths, Some results on \(k\)-Turán-good graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A problem of Erdős and Sós on 3-graphs
• Turán \(H\)-densities for 3-graphs
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• On the maximum number of five-cycles in a triangle-free graph
• Inducibility of directed paths
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• Pentagons vs. triangles
• On the number of \(C_ 5's\) in a triangle-free graph
• The maximum number of cliques in graphs without long cycles
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• Maximizing five-cycles in \(K_r\)-free graphs
• Supersaturation for subgraph counts
• Counting copies of a fixed subgraph in \(F\)-free graphs
• On the Minimal Density of Triangles in Graphs
• Induced Turán Numbers
• Minimizing the number of 5-cycles in graphs with given edge-density
• Flag algebras
• Counting flags in triangle-free digraphs
• Efficient testing of large graphs
• Many \(T\) copies in \(H\)-free graphs