Coverings of r—graphs by complete r—partite subgraphs

DOI10.1002/RSA.3240060218MaRDI QIDQ4697821zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl, P. 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

coverextremal problemshypergraphTurán number

Mathematics Subject Classification ID

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

Recommendations

• Decomposition of the complete r-graph into complete r-partite r-graphs
• Multicovering hypergraphs
• On some extremal problems on r-graphs
• Covering non-uniform hypergraphs
• On a problem of Erdős and Moser

Cites work

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

Cited in

(12)

• Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Covering non-uniform hypergraphs
• Multicovering hypergraphs
• On extremal problems of graphs and generalized graphs
• On some extremal problems on r-graphs
• DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE
• scientific article; zbMATH DE number 3972916 (Why is no real title available?)
• scientific article; zbMATH DE number 3979109 (Why is no real title available?)
• Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
• An upper bound for the excessive index of an r-graph
• scientific article; zbMATH DE number 3407723 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697821)