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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074250824 / 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

Latest revision as of 04:25, 5 July 2024

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

    Statements

    Identifiers