Packing hamilton cycles in random and pseudo-random hypergraphs (Q2909240): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q228771 / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119368576 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57401441 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1003.1958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Tight Hamilton Cycles in Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in random uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Hamilton cycles in random uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in random 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing Hamilton cycles in \(\varepsilon\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game of JumbleG / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac-type results for loose Hamilton cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods for algorithmic discrete mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs / rank
 
Normal rank

Latest revision as of 14:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Packing hamilton cycles in random and pseudo-random hypergraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references