Extremal subgraphs for two graphs

DOI10.1016/0095-8956(85)90070-XzbMath0554.05037WikidataQ106026250 ScholiaQ106026250MaRDI QIDQ759768

Paul Erdős, J. H. Spencer, Fan R. K. Chung

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

uniform hypergraphsgraph decompositionsextremal graph problemunavoidable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Problem books (00A07)

Related Items

On a local similarity of graphs, Quantitative graph theory: a new branch of graph theory and network science

Cites Work

• On unavoidable graphs
• Unavoidable stars in 3-graphs
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
• On a Ramsey type theorem
• Unnamed Item
• Unnamed Item