Universality for graphs with bounded density

DOI10.1016/J.JCTB.2026.01.004MaRDI QIDQ6844071zbMATH OpenFDO

Authors Noga Alon, Natalie Dodson, Carmen Jackson, Rose McCarty, Rajko Nenadov, Lani Southern

Publication date 16 March 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2026.01.004

zbMATH Keywords

near-optimal graph universality

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 5764887 (Why is no real title available?)
• scientific article; zbMATH DE number 16297 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3613090 (Why is no real title available?)
• scientific article; zbMATH DE number 1833411 (Why is no real title available?)
• A framework for solving VLSI graph layout problems
• Covering a hypergraph of subgraphs
• Decomposition of Finite Graphs Into Forests
• Distributed corruption detection in networks
• Efficient routing in optical networks
• Expander graphs and their applications
• Expanding graphs contain all small trees
• Explicit expanders of every degree and size
• Minimum partition of a matroid into independent subsets
• On Graphs Which Contain All Sparse Graphs
• On Universal Graphs for Spanning Trees
• On graphs which contain all small trees
• Perfect Storage Representations for Families of Data Structures
• Ramanujan graphs
• Rolling backwards can move you forward: on embedding problems in sparse expanders
• Small universal graphs
• Small universal graphs for bounded-degree planar graphs
• Sparse universal graphs
• Sparse universal graphs for bounded‐degree graphs
• Sparse universal graphs for planarity
• Strongly balanced graphs and random graphs
• The probabilistic method
• The threshold for the square of a Hamilton cycle
• Threshold functions for small subgraphs
• Wide-Sense Nonblocking Networks
• ``Integer-making theorems

This page was built for publication: Universality for graphs with bounded density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844071)