Turán problems and shadows. I: Paths and cycles (Q472166): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extremal Set-Intersection Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homological approach to two problems on finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized 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: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of finite sets no two of which intersect in a singleton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of some Turán-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs in which all disjoint pairs have distinct unions / 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 Turán numbers of linear cycles / 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: Hypergraph Extensions of the Erdős-Gallai Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Systems with No Singleton Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intersection theorem for four sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph extension of the bipartite Turán problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Erdős on triangles in set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal paths and cycles in set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of hypergraphs without generalized 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Ruzsa-Szemerédi theorem / rank
 
Normal rank

Latest revision as of 07:10, 9 July 2024

scientific article
Language Label Description Also known as
English
Turán problems and shadows. I: Paths and cycles
scientific article

    Statements

    Turán problems and shadows. I: Paths and cycles (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    hypergraph Turán number
    0 references
    paths
    0 references
    cycles
    0 references
    uniform hypergraphs
    0 references

    Identifiers