Name
Abstract | ||
|---|---|---|
AbstractOne of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdï s-Rényi random graph Gn,p is around p~logn+loglognn. Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3-uniform hypergraph by connecting 3-uniform hypergraphs to edge-colored graphs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/rsa.20475 | Periodicals |
Keywords | Field | DocType |
coloring,Hamilton cycles,random graphs | Discrete mathematics,Edge coloring,Random regular graph,Combinatorics,Indifference graph,Random graph,Chordal graph,Hypergraph,1-planar graph,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
44 | 3 | 1042-9832 |
Citations | PageRank | References |
10 | 0.92 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan M. Frieze | 1 | 4837 | 787.00 |
| Po-Shen Loh | 2 | 133 | 18.68 |