Complete subgraphs in multipartite graphs

DOI10.1007/s00493-012-2425-5zbMath1289.05231arXiv0910.1447OpenAlexW2069513471MaRDI QIDQ2392040

Florian Pfender

Publication date: 6 August 2013

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphsedge densitymultipartite graphs

Mathematics Subject Classification ID

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

Related Items (3)

Complete subgraphs in a multipartite graph ⋮ Long paths and connectivity in 1‐independent random graphs ⋮ A Density Turán Theorem

Cites Work

• Density conditions for triangles in multipartite graphs
• Unnamed Item

This page was built for publication: Complete subgraphs in multipartite graphs