Hypergraph Extensions of the Erdős-Gallai Theorem (Q2883632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2010.05.083 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Monochromatic Hamiltonian<i>t</i>-tight Berge-cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal \(k\)-edge-Hamiltonian hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2010.05.083 / rank
 
Normal rank

Latest revision as of 03:53, 20 December 2024

scientific article
Language Label Description Also known as
English
Hypergraph Extensions of the Erdős-Gallai Theorem
scientific article

    Statements

    Hypergraph Extensions of the Erdős-Gallai Theorem (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    extremal graph
    0 references
    hypergraph
    0 references
    Berge path
    0 references

    Identifiers