Name
Abstract | ||
|---|---|---|
We consider the following definition of connectedness in k-uniform hypergraphs: two j-sets (sets of j vertices) are j-connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. The hypergraph is j-connected if all j-sets are pairwise j-connected. We determine the threshold at which the random k-uniform hypergraph with edge probability p becomes j-connected with high probability. We also deduce a hitting time result for the random hypergraph process the hypergraph becomes j-connected at exactly the moment when the last isolated j-set disappears. This generalises the classical hitting time result of Bollobas and Thomason for graphs. |
Year | Venue | Keywords |
|---|---|---|
2016 | ELECTRONIC JOURNAL OF COMBINATORICS | random hypergraphs,connectedness,hitting time |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Hypergraph,Constraint graph,Hitting time,Mathematics,The Intersect | Journal | 23 |
Issue | ISSN | Citations |
2.0 | 1077-8926 | 3 |
PageRank | References | Authors |
0.58 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Cooley | 1 | 39 | 9.15 |
| Mihyun Kang | 2 | 163 | 29.18 |
| christoph koch | 3 | 3 | 0.58 |