Sciweavers

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

9

RSA
2016

favoriteEmaildiscussreport

88views more RSA 2016»

Meyniel's conjecture holds for random graphs

8 years 19 days ago

Meyniel's conjecture holds for random graphs

Download www.math.ryerson.ca

Pawel Pralat, Nicholas C. Wormald

Real-time Traffic

RSA 2016 |

claim paper

Related Content

» Complete Minors and Independence Number

» Word maps and spectra of random graph lifts

» On sums of independent random variables with unbounded variance and estimating the average...

» Twopoint concentration in random geometric graphs

» Vertex Cover in Graphs with Locally Few Colors

» Testing kwise and almost kwise independence

» How to Play Unique Games against a SemiRandom Adversary

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

Post Info
More Details (n/a)

Added	09 Apr 2016
Updated	09 Apr 2016
Type	Journal
Year	2016
Where	RSA
Authors	Pawel Pralat, Nicholas C. Wormald

Comments (0)