The following pages link to Sparse universal graphs (Q1612288):
Displaying 22 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)
- Sparse multipartite graphs as partition universal for graphs with bounded degree (Q1743481) (← links)
- Non-Ramsey graphs are \(c\log n\)-universal (Q1818220) (← links)
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
- Discrete Kakeya-type problems and small bases (Q2655785) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Small universal graphs (Q2819605) (← links)
- Size Ramsey number of bounded degree graphs for games (Q2841487) (← links)
- Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ (Q3061179) (← links)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026) (← links)
- On Graphs Which Contain All Sparse Graphs (Q3958492) (← links)
- Near-optimum universal graphs for graphs with bounded degrees (extended abstract) (Q4780792) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- Sparse universal graphs for bounded‐degree graphs (Q5433254) (← links)
- Almost‐spanning universality in random graphs (Q5739095) (← links)
- (Q5743497) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- A note on universal graphs for spanning trees (Q6657271) (← links)
