Cycles in a random graph near the critical point

DOI10.1002/rsa.3240020405zbMath0755.05089OpenAlexW2149745907MaRDI QIDQ3986108

Tomasz Łuczak

Publication date: 27 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240020405

zbMATH Keywords

cyclecritical pointcorerandom graphblock structure

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items

The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes, Waiter-Client and Client-Waiter planarity, colorability and minor games, The critical mean-field Chayes–Machta dynamics, The birth of the giant component, Phase transition phenomena in random discrete structures, On the number of circuits in random graphs, The number of connected sparsely edged uniform hypergraphs, The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property, A note on long cycles in sparse random graphs, The mesoscopic geometry of sparse random maps, Cycle lengths in sparse random graphs, Longest and shortest cycles in random planar graphs, Appearance of complex components in a random bigraph, Component behaviour and excess of random bipartite graphs near the critical point, Geodesic cycles in random graphs, The Diameter of Sparse Random Graphs, Longest Paths in Random Hypergraphs, Counting connected graphs inside-out, The critical behavior of random digraphs, Minors in random regular graphs, Anatomy of the giant component: the strictly supercritical regime, The phase transition in the cluster‐scaled model of a random graph, Anatomy of a young giant component in the random graph, Large cycles in random generalized Johnson graphs, On the Spread of Random Graphs, Longest cycles in sparse random digraphs, On the performance of the depth first search algorithm in supercritical random graphs, Loose cores and cycles in random hypergraphs, Cover time of a random graph with a degree sequence II: Allowing vertices of degree two

Cites Work

• Unnamed Item
• The chromatic number of random graphs at the double-jump threshold
• The first cycles in an evolving graph
• On large matchings and cycles in sparse random graphs
• The isoperimetric number of random regular graphs
• The longest path in a random graph
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• On tree census and the giant component in sparse random graphs