@article{dmtcs:3457,
    title      = {Matchings and Hamilton cycles in hypergraphs},
    author     = {Daniela Kühn and Deryk Osthus},
    url        = {https://dmtcs.episciences.org/3457},
    doi        = {10.46298/dmtcs.3457},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
    issuetitle = {Proceedings},
    eid        = 67,
    year       = {2005},
    month      = {Jan},
    keywords   = {matchings, Hamilton cycles, packings, uniform hypergraphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]},
    language   = {English},
}