Coverings of r—graphs by complete r—partite subgraphs

DOI10.1002/rsa.3240060218zbMath0818.05037OpenAlexW2169799344MaRDI QIDQ4697821

Vojtěch Rödl, Paul Erdős

Publication date: 28 May 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060218

zbMATH Keywords

hypergraphextremal problemscoverTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Lower bounds for Turán's problem
• On the coverings of graphs

This page was built for publication: Coverings of r—graphs by complete r—partite subgraphs