48 search results - page 1 / 10 » Large k-Separated Matchings of Random Regular Graphs |
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
RSA
2010
13 years 5 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
JCT
2007
13 years 7 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...