Hypergraph Ramsey numbers: tight cycles versus cliques (Q2788661): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The early evolution of the \(H\)-free process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic concentration of the triangle-free process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the stepping-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for a Ramsey-type problem / rank
 
Normal rank

Latest revision as of 11:53, 11 July 2024

scientific article
Language Label Description Also known as
English
Hypergraph Ramsey numbers: tight cycles versus cliques
scientific article

    Statements

    Hypergraph Ramsey numbers: tight cycles versus cliques (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3-uniform tight cycle \(C^3_s\)
    0 references
    0 references
    0 references