Sparse universal graphs

DOI10.1016/S0377-0427(01)00455-1zbMath0997.05047MaRDI QIDQ1612288

Vera Asodi, Noga Alon

Publication date: 22 August 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

universal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Universal and unavoidable graphs ⋮ Induced-universal graphs for graphs with bounded maximum degree ⋮ Almost-spanning universality in random graphs (extended abstract) ⋮ Discrete Kakeya-type problems and small bases ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ Almost‐spanning universality in random graphs ⋮ Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ ⋮ On universal hypergraphs ⋮ Universality of random graphs and rainbow embedding ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small universal graphs
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• On Graphs Which Contain All Sparse Graphs