Extremal subgraphs for two graphs

DOI10.1016/0095-8956(85)90070-XzbMATH Open0554.05037WikidataQ106026250 ScholiaQ106026250MaRDI QIDQ759768FDOQ759768

Authors: Fan Chung, Joel Spencer, P. Erdős 

Publication date: 1985

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

Recommendations

• scientific article; zbMATH DE number 3900797
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• scientific article; zbMATH DE number 3675942
• scientific article; zbMATH DE number 1234983
• Induced decompositions of graphs

zbMATH Keywords

uniform hypergraphsgraph decompositionsextremal graph problemunavoidable graphs

Mathematics Subject Classification ID

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

Cites Work

• On a Ramsey type theorem
• Title not available (Why is that?)
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• On unavoidable graphs
• Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
• Title not available (Why is that?)
• Unavoidable stars in 3-graphs

Cited In (9)

• Extremal Parameters in Sub-Critical Graph Classes
• Quantitative graph theory: a new branch of graph theory and network science
• On a local similarity of graphs
• Title not available (Why is that?)
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal Graphs without Large Forbidden Subgraphs
• Induced decompositions of graphs

This page was built for publication: Extremal subgraphs for two graphs

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