The following pages link to Almost universal graphs (Q5486325):
Displaying 13 items.
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Universally signable graphs (Q1375057) (← links)
- Universal geometric graphs (Q2110618) (← links)
- Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ (Q3061179) (← links)
- Sharp threshold for the appearance of certain spanning trees in random graphs (Q3145834) (← links)
- (Q3496356) (← links)
- Properties of Almost All Graphs and Generalized Quantifiers (Q3561218) (← 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)
- (Q5743497) (← links)
- Some remarks on universal graphs (Q5906404) (← links)
- Graph Traversals as Universal Constructions (Q6168427) (← links)
