Universality for Graphs of Bounded Degeneracy
Random Structures & Algorithms · 2026-03 · 68 (2)
DOI: 10.1002/rsa.70055 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 11.03.2026. Verfasst von Peter Allen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Australian Research Council.
Abstract (Originalsprache)
Given a family of graphs, a graph is called ‐universal if contains every graph of as a subgraph. Following the extensive research on universal graphs of small size for bounded‐degree graphs, Alon asked what is the minimum number of edges that a graph must have to be universal for the class of all ‐vertex graphs that are ‐degenerate. In this paper, we answer this question up to a factor that is polylogarithmic in .
Förderung
- Australian Research Council
Zitieren
APA
Allen, P., Böttcher, J., & Liebenau, A. (2026). Universality for Graphs of Bounded Degeneracy. Random Structures & Algorithms, 68(2). https://doi.org/10.1002/rsa.70055
Vancouver
Allen P, Böttcher J, Liebenau A. Universality for Graphs of Bounded Degeneracy. Random Structures & Algorithms. 2026;68(2). doi:10.1002/rsa.70055
BibTeX
@article{Allen2026,
author = {Allen, Peter and Böttcher, Julia and Liebenau, Anita},
title = {Universality for Graphs of Bounded Degeneracy},
journal = {Random Structures & Algorithms},
year = {2026},
volume = {68},
number = {2},
doi = {10.1002/rsa.70055}
}
EUVIMED