On the minimum degree of minimal Ramsey graphs for multiple colours (Q290809): 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: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The triangle-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: Graphs without large triangle free subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of senders in generalized Ramsey theory for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for diagonal Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Ramsey numbers of Erdős and Rogers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Certain Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum degree of Ramsey-minimal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-Ramsey number of trees / 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: <i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ramsey Minimal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey numbers of graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem - a new lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic lower bounds for Ramsey functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive lower bounds on classical multicolor Ramsey numbers / rank
 
Normal rank

Latest revision as of 03:10, 12 July 2024

scientific article
Language Label Description Also known as
English
On the minimum degree of minimal Ramsey graphs for multiple colours
scientific article

    Statements

    On the minimum degree of minimal Ramsey graphs for multiple colours (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 June 2016
    0 references
    Ramsey theory
    0 references
    minimal Ramsey graphs
    0 references
    minimum degree
    0 references
    Erdős-Rogers function
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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