1542 search results - page 8 / 309 » The metamathematics of random graphs |
COMBINATORICA
2010
13 years 7 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
JCT
2010
13 years 8 months ago
2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
CORR
2011
Springer
13 years 4 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...
RSA
2000
13 years 9 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
COMBINATORICS
1999
13 years 9 months ago
1999
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...