scientific article; zbMATH DE number 1833411
From MaRDI portal
Publication:4780792
Recommendations
Cited in
(18)- Sparse universal graphs
- Optimal induced universal graphs for bounded-degree graphs
- Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\)
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On finite superuniversal graphs
- Small universal graphs
- On universal hypergraphs
- Optimal induced universal graphs for bounded-degree graphs
- Sparse partition universal graphs for graphs of bounded degree
- Sparse universal graphs for bounded‐degree graphs
- Almost-spanning universality in random graphs (extended abstract)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- Almost universal graphs
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
- Optimal threshold for a random graph to be 2-universal
- Induced-universal graphs for graphs with bounded maximum degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780792)