Turán numbers of complete 3-uniform Berge-hypergraphs (Q2413629): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1612.08856 / 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: Hypergraph Turán numbers of linear cycles / 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: A hypergraph extension of Turán's theorem / 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: Hypergraphs with No Cycle of a Given Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-uniform hypergraphs avoiding a given odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán problems and shadows. I: Paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact computation of the hypergraph Turán function for expanded complete 2-graphs / rank
 
Normal rank

Latest revision as of 14:23, 16 July 2024

scientific article
Language Label Description Also known as
English
Turán numbers of complete 3-uniform Berge-hypergraphs
scientific article

    Statements

    Identifiers

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