New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) (Q2502037): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Ramsey numbers for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without four-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multicolor Ramsey numbers for complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ramsey numbers N(3,3,\dots ,3;2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Ramsey numbers for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number r(C<sub>7</sub>,C<sub>7</sub>,C<sub>7</sub>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised Ramsey numbers for small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282930 / rank
 
Normal rank

Revision as of 19:03, 24 June 2024

scientific article
Language Label Description Also known as
English
New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
scientific article

    Statements

    New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2006
    0 references
    edge coloring
    0 references
    forbidden subgraph
    0 references
    cycle
    0 references

    Identifiers