On Graphs Which Contain All Sparse Graphs
From MaRDI portal
Publication:3958492
DOI10.1016/S0304-0208(08)73486-8zbMath0495.05035WikidataQ105673195 ScholiaQ105673195MaRDI QIDQ3958492
László Babai, Paul Erdős, J. H. Spencer, Ronald L. Graham, Fan R. K. Chung
Publication date: 1982
Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)
05C35: Extremal problems in graph theory
Related Items
Adjacency Labeling Schemes and Induced-Universal Graphs, Optimal threshold for a random graph to be 2-universal, Unnamed Item, Almost‐spanning universality in random graphs, Almost-spanning universality in random graphs (extended abstract), On unavoidable graphs, On universal hypergraphs, Induced-universal graphs for graphs with bounded maximum degree, Sparse universal graphs, Sparse multipartite graphs as partition universal for graphs with bounded degree, Universality of random graphs and rainbow embedding, Perfect Storage Representations for Families of Data Structures, Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$