Random subgraphs of the n-cycle

DOI10.1016/0012-365X(84)90085-2zbMath0549.05047OpenAlexW1980134326MaRDI QIDQ800378

Louis V. Quintas, Zbigniew Palka

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90085-2

zbMATH Keywords

cycleasymptotic behaviourrandom subgraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (3)

A generating function approach to random subgraphs of the \(n\)-cycle ⋮ Random subgraphs of the \(n\)-cycle and the \(n\)-wheel ⋮ The largest component in a random subgraph of the \(n\)-cycle

Cites Work

• On the degrees of vertices in a bichromatic random graph
• On the number of vertices of given degree in a random graph
• Vertices of given degree in a random graph
• A review of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random subgraphs of the n-cycle