23 search results - page 1 / 5 » Hamilton cycles in random subgraphs of pseudo-random graphs |
90
Voted
DM
2002
15 years 3 months ago
2002
123
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
319
Voted
Book
A classic book on graph theory.
335
Voted
Book
A well-written book about graph theory.
119
Voted
EJC
2006
15 years 3 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)