On unavoidable graphs

DOI10.1007/BF02579290MaRDI QIDQ595677zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

subgraphsTuran-like propertyunavoidable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Review text

A graph \(G\) is called an \((n,e)\)-unavoidable graph if every graph on \(n\) vertices and \(e\) edges contains \(G\) as a subgraph. Let \(f(n,e)\) denote the largest integer \(m\) with the property that there exists an \((n,e)\)-unavoidable graph on \(m\) edges. In this paper the authors obtain bounds on \(f(n,e)\) which are in many cases asymptotically best possible.

Recommendations

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

Cites work

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

Cited in

(13)

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