Universal and unavoidable graphs

DOI10.1017/S0963548321000110OpenAlexW2994758570MaRDI QIDQ5886120

Matija Bucić, Nemanja Draganić, Benjamin Sudakov

Publication date: 30 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.04889

zbMATH Keywords

probabilistic methoduniversal graphsTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Unavoidable hypergraphs

Cites Work

• On unavoidable graphs
• On universal hypergraphs
• Unavoidable stars in 3-graphs
• Embedding nearly-spanning bounded degree trees
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Sparse universal graphs
• What we know and what we do not know about Turán numbers
• Spanning trees in random graphs
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• On the Erdös-Stone Theorem
• On Graphs Which Contain All Sparse Graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• On the Structure of Edge Graphs
• On Universal Graphs for Spanning Trees
• On unavoidable hypergraphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Sparse universal graphs for bounded‐degree graphs
• Almost‐spanning universality in random graphs
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item