213 search results - page 4 / 43 » Regular subgraphs of random graphs |
119
Voted
CPC
2010
14 years 9 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
DM
2002
14 years 11 months ago
2002
129
click to vote
ACID
2006
15 years 1 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
114
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
70
Voted
IM
2007
14 years 11 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...