On Graphs Which Contain All Sparse Graphs
From MaRDI portal
Publication:3958492
DOI10.1016/S0304-0208(08)73486-8zbMath0495.05035OpenAlexW999599142WikidataQ105673195 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)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73486-8
Related Items
Universal and unavoidable graphs, Induced-universal graphs for graphs with bounded maximum degree, Almost-spanning universality in random graphs (extended abstract), Adjacency Labeling Schemes and Induced-Universal Graphs, On unavoidable graphs, Sparse universal graphs for planarity, Packing topological minors half‐integrally, Graph product structure for non-minor-closed classes, Graph theory. Abstracts from the workshop held January 2--8, 2022, Sparse multipartite graphs as partition universal for graphs with bounded degree, Almost‐spanning universality in random graphs, Perfect Storage Representations for Families of Data Structures, 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, Shorter Labeling Schemes for Planar Graphs, Unnamed Item, Sparse universal graphs
