Pages that link to "Item:Q4780792"
From MaRDI portal
The following pages link to Near-optimum universal graphs for graphs with bounded degrees (extended abstract) (Q4780792):
Displaying 18 items.
- Almost-spanning universality in random graphs (extended abstract) (Q322227) (← links)
- Sparse partition universal graphs for graphs of bounded degree (Q633606) (← links)
- On universal hypergraphs (Q727206) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- On finite superuniversal graphs (Q1253665) (← links)
- Sparse universal graphs (Q1612288) (← links)
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
- Small universal graphs (Q2819605) (← links)
- Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ (Q3061179) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026) (← links)
- Optimal induced universal graphs for bounded-degree graphs (Q4575816) (← links)
- Optimal induced universal graphs for bounded-degree graphs (Q4614763) (← links)
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs (Q5111460) (← links)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- Sparse universal graphs for bounded‐degree graphs (Q5433254) (← links)
- Almost universal graphs (Q5486325) (← links)
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382) (← links)
