Long paths in sparse random graphs

DOI10.1007/BF02579230zbMath0525.05051OpenAlexW1964236046MaRDI QIDQ594110

Béla Bollobás

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579230

zbMATH Keywords

pathrandom directed graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Combinatorial probability (60C05)

Related Items

Finding Hamilton cycles in sparse random graphs, On large matchings and cycles in sparse random graphs, Deterministic Graph Games and a Probabilistic Intuition, A note on long cycles in sparse random graphs, Cycle lengths in sparse random graphs, Rainbow trees in uniformly edge‐colored graphs, Turán‐type problems for long cycles in random and pseudo‐random graphs, Scaling window for mean-field percolation of averages, Geodesic cycles in random graphs, Embedding nearly-spanning bounded degree trees, Paths and cycles in random subgraphs of graphs with large minimum degree, A scaling limit for the length of the longest cycle in a sparse random graph, Large cycles in random generalized Johnson graphs, Large induced trees in sparse random graphs, Longest cycles in sparse random digraphs, A Random Graph With a Subcritical Number of Edges

Cites Work

• Unnamed Item
• The longest path in a random graph
• On the existence of Hamiltonian cycles in a class of random graphs