On unavoidable graphs

DOI10.1007/BF02579290zbMATH Open0527.05042OpenAlexW1971894923MaRDI QIDQ595677FDOQ595677

Authors: Fan Chung, P. Erdős 

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579290

Recommendations

• On unavoidable hypergraphs
• Graphs with unavoidable subgraphs with large degrees
• scientific article; zbMATH DE number 4101231
• Unavoidable hypergraphs
• Unavoidable subgraphs of colored graphs

zbMATH Keywords

subgraphsTuran-like propertyunavoidable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• On the theory of graphs
• On Graphs Which Contain All Sparse Graphs
• On Universal Graphs for Spanning Trees
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Universal caterpillars
• On graphs which contain all small trees

Cited In (12)

• Unavoidable hypergraphs
• The maximum number of edges in a 3-graph not containing a given star
• Unavoidable vertex-minors in large prime graphs
• Minimal unavoidable sets of cycles in plane graphs
• Computing maximum unavoidable subgraphs using SAT solvers
• Mathematical problems and games
• Avoidance couplings on non‐complete graphs
• Universal and unavoidable graphs
• Extremal subgraphs for two graphs
• Absolutely avoidable order-size pairs for induced subgraphs
• Turán numbers of sunflowers
• The maximum number of triangles in \(F_k\)-free graphs

This page was built for publication: On unavoidable graphs

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