The complete value of the Turán number of \(3K_{p+1}\)

DOI10.1016/j.disc.2024.113941OpenAlexW4392180287MaRDI QIDQ6204352

Liang Zhang, Jian Hua Yin

Publication date: 27 March 2024

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

Full work available at URL: https://doi.org/10.1016/j.disc.2024.113941

zbMATH Keywords

cliqueTurán number\(k K_{p + 1}\)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• The Turán number of the graph \(2P_5\)
• Equitable and proportional coloring of trees
• Path Ramsey numbers in multicolorings
• The Turán number of star forests
• Extremal graphs for two vertex-disjoint copies of a clique
• The Turán number of \(k \cdot S_\ell \)
• The Turán number of disjoint copies of paths
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• The Turàn number of the graph 3P4
• On Independent Complete Subgraphs in a Graph
• A proof for a conjecture of Gorgol
• Turán numbers for disjoint paths

This page was built for publication: The complete value of the Turán number of \(3K_{p+1}\)