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

DOI10.1016/0012-365X(95)00164-RzbMath0938.05055MaRDI QIDQ1357744

Xavier Gourdon, Prodinger, Helmut

Publication date: 16 June 1997

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

zbMATH Keywords

generating functionscyclevarianceexpectationrandom subgraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (5)

Measures of distinctness for random partitions and compositions of an integer ⋮ Record statistics in a random composition ⋮ Unnamed Item ⋮ Alphabetic points in compositions and words ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random subgraphs of the n-cycle
• Periods in strings
• The largest component in a random subgraph of the \(n\)-cycle
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION

This page was built for publication: A generating function approach to random subgraphs of the \(n\)-cycle