Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs

DOI10.1016/j.disc.2017.09.016zbMath1376.05072arXiv1610.00777OpenAlexW2528023409WikidataQ59940777 ScholiaQ59940777MaRDI QIDQ1686004

Peng Zhang

Publication date: 20 December 2017

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

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

zbMATH Keywords

Turán numbermultipartite graphextremal numberdisjoint cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Turán number of disjoint triangles in 4-partite graphs ⋮ Extremal numbers of disjoint triangles in \(r\)-partite graphs ⋮ Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ On the Turán numbers of \(k K_r\) in \(\ell \)-partite graphs ⋮ Weighted Turán problems with applications ⋮ Turán problems for vertex-disjoint cliques in multi-partite hypergraphs

Cites Work

• 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\)
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• The Turán number of disjoint copies of paths
• Turán Numbers of Multiple Paths and Equibipartite Forests
• The Turàn number of the graph 3P4

This page was built for publication: Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs