On the Probability that a Random Subgraph Contains a Circuit

DOI10.1002/jgt.22095zbMath1367.05196arXiv1502.05009OpenAlexW2963199049MaRDI QIDQ4978293

No author found.

Publication date: 8 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.05009

zbMATH Keywords

cyclecircuits

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
• Random walks and percolation on trees
• The Moore bound for irregular graphs
• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs
• On the Error-Correcting Capabilities of Cycle Codes of Graphs
• Regular graphs whose subgraphs tend to be acyclic
• On the Non-Planarity of a Random Subgraph
• Probability