108 research outputs found
On random k-out sub-graphs of large graphs
We consider random sub-graphs of a fixed graph with large minimum
degree. We fix a positive integer and let be the random sub-graph
where each independently chooses random neighbors, making
edges in all. When the minimum degree then is -connected w.h.p. for ;
Hamiltonian for sufficiently large. When , then has
a cycle of length for . By w.h.p. we mean
that the probability of non-occurrence can be bounded by a function
(or ) where
An extensive English language bibliography on graph theory and its applications, supplement 1
Graph theory and its applications - bibliography, supplement
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application
- …