Connectivity of the k-Out Hypercube

DOI10.1137/17M1134226zbMath1394.05112arXiv1706.03390WikidataQ129320141 ScholiaQ129320141MaRDI QIDQ4584954

Michael Anastos

Publication date: 5 September 2018

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

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

zbMATH Keywords

hypercubeconnectivityrandom subgraphs\(k\)-out model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypercube percolation
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Exact face-isoperimetric inequalities
• On the connectivity of random m-orientable graphs and digraphs
• Largest random component of a k-cube
• Evolution of the \(n\)-cube
• Introduction to Random Graphs
• On randomk-out subgraphs of large graphs
• Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
• The Evolution of Random Subgraphs of the Cube
• Connectivity properties of random subgraphs of the cube
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Connectivity of the k-Out Hypercube