Name
Abstract | ||
|---|---|---|
We say that a k-uniform hypergraph C is a Hamilton cycle of type l, for some 1 <= l <= k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices, and for every pair of consecutive edges Ei-1, E-i in C (in the natural ordering of the edges) we have vertical bar Ei-1\E-i vertical bar = l. We define a class of (epsilon, p)-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type l Hamilton cycles, where l < k/2. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1137/11082378X | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | Field | DocType |
Hamilton cycles,pseudorandom hypergraphs,packings | Discrete mathematics,Combinatorics,Vertex (geometry),Hamiltonian path,Constraint graph,Hypergraph,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 2 | 0895-4801 |
Citations | PageRank | References |
7 | 0.69 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepak Bal | 1 | 35 | 7.32 |
| Alan M. Frieze | 2 | 4837 | 787.00 |