scientific article; zbMATH DE number 4039957
From MaRDI portal
Publication:3778795
[For the entire collection see Zbl 0626.00008.] An induced subgraph of an n-cube is obtained by selecting vertices at random independently and with a common probability p. A spanning subgraph of an n-cube is obtained by selecting edges at random independently and with a common probability p. The independence numbers of these two random subgraphs are given for np\(\to \infty\) as \(n\to \infty\).
Recommendations
Cited in
(6)- Subcube Coverings of Random Spanning Subgraphs of then-Cube
- scientific article; zbMATH DE number 3977048 (Why is no real title available?)
- scientific article; zbMATH DE number 4010568 (Why is no real title available?)
- scientific article; zbMATH DE number 125466 (Why is no real title available?)
- scientific article; zbMATH DE number 747047 (Why is no real title available?)
- scientific article; zbMATH DE number 1870235 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778795)