Sciweavers

Share
RSA
2006

Almost universal graphs

12 years 1 months ago
Almost universal graphs
We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c
Alan M. Frieze, Michael Krivelevich
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2006
Where RSA
Authors Alan M. Frieze, Michael Krivelevich
Comments (0)
books