| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651952 | Electronic Notes in Discrete Mathematics | 2015 | 9 Pages |
Abstract
In this note we adapt a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2, 125–148] from random graphs to random r-uniform hypergaphs. We also discuss several spanning structures such as cube-hypergraphs, lattices, spheres and Hamilton cycles in hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
