Minimum degree of 3-graphs without long linear paths (Q776262): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tight cycles and regular slices in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graphs without long paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers for Forests of Paths in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős-Gallai type theorem for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / 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: Path Ramsey numbers in multicolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán problems and shadows. I: Paths and cycles / rank
 
Normal rank

Revision as of 01:19, 23 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree of 3-graphs without long linear paths
scientific article

    Statements

    Identifiers

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