42 search results - page 5 / 9 » Small subgraphs of random regular graphs |
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 → ∞,...
INFOCOM
2003
IEEE
14 years 1 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...
ALGORITHMICA
2011
13 years 2 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...
SIAMDM
2008
13 years 7 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...
FOCS
2008
IEEE
14 years 2 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...