Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

RSA
2006

favoriteEmaildiscussreport

132views more RSA 2006»

Almost universal graphs

13 years 4 months ago

Almost universal graphs

Download www.math.cmu.edu

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

Real-time Traffic

Random Graph | RSA 2006 |

claim paper

Related Content

» Almost random graphs with simple hash functions

» The diameter of random massive graphs

» Testing kwise and almost kwise independence

» Expanders are universal for the class of all spanning trees

» Two New Classes of Hamiltonian Graphs Extended Abstract

» A random graph model for massive graphs

» Almost All Objects Are Universal in Message Passing Systems

» Almost Every Domain is Universal

» A Combinatorial Construction of AlmostRamanujan Graphs Using the ZigZag Product

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2006
Where	RSA
Authors	Alan M. Frieze, Michael Krivelevich

Comments (0)