Random subgraphs of the n-cycle

DOI10.1016/0012-365X(84)90085-2zbMATH Open0549.05047OpenAlexW1980134326MaRDI QIDQ800378FDOQ800378

Authors: 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

Recommendations

• The largest component in a random subgraph of the \(n\)-cycle
• Cycles in a random graph near the critical point
• Random subgraphs of the \(n\)-cycle and the \(n\)-wheel
• A generating function approach to random subgraphs of the \(n\)-cycle
• Cycles in random graphs

zbMATH Keywords

asymptotic behaviourcyclerandom subgraph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertices of given degree in a random graph
• On the number of vertices of given degree in a random graph
• On the degrees of vertices in a bichromatic random graph
• Title not available (Why is that?)
• A review of random graphs

Cited In (6)

• A generating function approach to random subgraphs of the \(n\)-cycle
• The largest component in a random subgraph of the \(n\)-cycle
• Randomly \(2C_n\) graphs
• Random subgraphs of the \(n\)-cycle and the \(n\)-wheel
• Randomly \(C_n\cup C_m\) graphs
• Isolated cycles of critical random graphs

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

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