Pages that link to "Item:Q3061179"

The following pages link to Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ (Q3061179):

Displaying 11 items.

• Sparse partition universal graphs for graphs of bounded degree (Q633606) (← links)
• On universality of graphs with uniformly distributed edges (Q1089355) (← links)
• Sparse universal graphs (Q1612288) (← links)
• A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
• Universality of random graphs and rainbow embedding (Q2811163) (← 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)
• An improved upper bound on the density of universal random graphs (Q4982616) (← links)
• Sparse universal graphs for bounded‐degree graphs (Q5433254) (← links)
• Almost universal graphs (Q5486325) (← links)
• (Q5743497) (← links)