Universal and unavoidable graphs

DOI10.1017/S0963548321000110MaRDI QIDQ5886120

Matija Bucić, Benjamin Sudakov, Nemanja Draganić

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 method; universal graphs; Turán number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C75: Structural characterization of families of graphs

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)