Small universal graphs

DOI10.1145/301250.301446zbMath1345.05097OpenAlexW1975791680WikidataQ105584192 ScholiaQ105584192MaRDI QIDQ2819605

M. R. Capalbo, S. Rao Kosaraju

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301446

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Induced-universal graphs for graphs with bounded maximum degree ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Unnamed Item ⋮ Sparse universal graphs

This page was built for publication: Small universal graphs