On unavoidable graphs

DOI10.1007/BF02579290zbMath0527.05042OpenAlexW1971894923MaRDI QIDQ595677

Fan R. K. Chung, Paul Erdős

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

subgraphsTuran-like propertyunavoidable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Universal and unavoidable graphs, The maximum number of edges in a 3-graph not containing a given star, Turán numbers of sunflowers, Mathematical problems and games, The maximum number of triangles in \(F_k\)-free graphs, Unavoidable hypergraphs, Extremal subgraphs for two graphs

Cites Work

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