( en | de | ru )

 

Disambiguation of "Wormald, Nicholas C."

Author of the publication

copydeleteadd this publication to your clipboard
The mixing time of the giant component of a random graph.

, , and . Random Struct. Algorithms, 45 (3): 383-407 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicholas Kiefer

Nicholas Mitchell

Nicholas Pascoe

Nicholas Loewer

Nicholas Ring

 

Other publications of authors with the same name

Fast Uniform Generation of Random Graphs with Given Degree Sequences., , and . FOCS, page 1371-1379. IEEE Computer Society, (2019)The mixing time of the giant component of a random graph., , and . Random Struct. Algorithms, 45 (3): 383-407 (2014)The evolution and structure of social networks., and . Network Science, 2 (3): 326-340 (2014)Growing Protean Graphs., and . Internet Math., 4 (1): 1-16 (2007)Numbers of cubic graphs., and . J. Graph Theory, 7 (4): 463-467 (1983)Load balancing and orientability thresholds for random hypergraphs., and . STOC, page 97-104. ACM, (2010)On the threshold for k-regular subgraphs of random graphs., , and . Combinatorica, 31 (5): 565-581 (2011)Almost All Cubic Graphs Are Hamiltonian., and . Random Struct. Algorithms, 3 (2): 117-126 (1992)Hamilton cycles containing randomly selected edges in random regular graphs., and . Random Struct. Algorithms, 19 (2): 128-147 (2001)Component Games on Random Graphs., , , , and . Comb., 42 (6): 1189-1229 (December 2022)