Constructive lower bounds on classical multicolor Ramsey numbers
From MaRDI portal
Publication:1883648
zbMath1053.05090MaRDI QIDQ1883648
Xiaodong Xu, Geoffrey Exoo, Zheng Xie, Stanislaw P. Radziszowski
Publication date: 13 October 2004
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124018
Related Items
On the minimum degree of minimal Ramsey graphs for multiple colours, Poonen's conjecture and Ramsey numbers, On colorful edge triples in edge-colored complete graphs, Coloring the cliques of line graphs, Generalized Paley graphs and their complete subgraphs of orders three and four, Strictly monotonic multidimensional sequences and stable sets in pillage games, List Ramsey numbers, Multicolor list Ramsey numbers grow exponentially, A generalised linear Ramsey graph construction, Unnamed Item, The Schur-Erdős problem for semi-algebraic colorings, A Ramsey bound on stable sets in Jordan pillage games, Unnamed Item, Gallai-Ramsey numbers for multiple triangles, Lower bounding the boundary of a graph in terms of its maximum or minimum degree, New lower bounds for seven classical Ramsey numbers \(R(3,q)\), Unnamed Item, Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, The multi-color Ramsey number of an odd cycle, On a diagonal conjecture for classical Ramsey numbers, On the multi-colored Ramsey numbers of cycles, On Some Open Questions for Ramsey and Folkman Numbers
