Long paths in sparse random graphs

DOI10.1007/BF02579230MaRDI QIDQ594110zbMATH OpenOpenAlexFDO

Authors 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) Combinatorial probability (60C05) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• On the existence of Hamiltonian cycles in a class of random graphs
• The longest path in a random graph

Cited in

(16)

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

This page was built for publication: Long paths in sparse random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q594110)