Publication:4200095
From MaRDI portal
zbMath0413.05041MaRDI QIDQ4200095
Dominique Sotteau, Marie-Claude Heydemann, Jean-Claude Bermond, Anne Germa
Publication date: 1978
cycles; uniform hypergraphs; edge partition; theorem of Dirac; hamiltonian cycles; theorem of Ore; hamiltonian hypergraphs
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs, Unnamed Item, Counting Hamilton cycles in Dirac hypergraphs, The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs, Minimum degree ensuring that a hypergraph is Hamiltonian-connected, Minimum degree conditions for tight Hamilton cycles, On extremal hypergraphs for Hamiltonian cycles, A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs, On the Hamiltonicity of triple systems with high minimum degree, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Loose Hamilton cycles in hypergraphs, Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, Berge cycles in non-uniform hypergraphs, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, Hamilton-chain saturated hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, On Hamiltonian Berge cycles in [3-uniform hypergraphs], Spanning surfaces in \(3\)-graphs, Hamiltonian paths and cycles in some 4-uniform hypergraphs, A Dirac-type theorem for Berge cycles in random hypergraphs, Recent advances on the Hamiltonian problem: survey III, Decompositions of complete uniform hypergraphs into Hamilton Berge cycles, Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length
