The largest component in a random subgraph of the \(n\)-cycle

DOI10.1016/0012-365X(93)90543-3zbMath0782.05074OpenAlexW2075841730MaRDI QIDQ1309458

Louis V. Quintas

Publication date: 6 January 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90543-3

zbMATH Keywords

probabilityrandom subgraphlargest component\(n\)-cycle

Mathematics Subject Classification ID

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

Related Items (1)

A generating function approach to random subgraphs of the \(n\)-cycle

Cites Work

• Random subgraphs of the n-cycle
• Random subgraphs of the \(n\)-cycle and the \(n\)-wheel
• Unnamed Item

This page was built for publication: The largest component in a random subgraph of the \(n\)-cycle