Packing tight Hamilton cycles in 3-uniform hypergraphs (Q2884005): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3720644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / 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 two Hamilton cycle problems in random graphs / 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: Packing hamilton cycles in random and pseudo-random hypergraphs / 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: Loose Hamilton cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse pseudo‐random graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods for algorithmic discrete mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of complete 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708622 / rank
 
Normal rank

Latest revision as of 04:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Packing tight Hamilton cycles in 3-uniform hypergraphs
scientific article

    Statements

    Packing tight Hamilton cycles in 3-uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    tight Hamilton cycles
    0 references
    random hypergraphs
    0 references
    packing
    0 references

    Identifiers

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