42 search results - page 5 / 9 » Small subgraphs of random regular graphs |
121
Voted
JCT
2007
15 years 3 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 → ∞,...
114
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
146
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
134
click to vote
SIAMDM
2008
15 years 3 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
124
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...