Sharp bounds for some multicolour Ramsey numbers
From MaRDI portal
Publication:2494438
DOI10.1007/s00493-005-0011-9zbMath1090.05049MaRDI QIDQ2494438
Publication date: 27 June 2006
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-005-0011-9
05C55: Generalized Ramsey theory
Related Items
EXPANDER GRAPHS AND SIEVING IN COMBINATORIAL STRUCTURES, An improved lower bound on multicolor Ramsey numbers, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, On Some Open Questions for Ramsey and Folkman Numbers, Many \(T\) copies in \(H\)-free graphs, Many \(T\) copies in \(H\)-free graphs, Combinatorics. Abstracts from the workshop held January 1--7, 2023, A lower bound for set‐coloring Ramsey numbers, A note on pseudorandom Ramsey graphs, The asymptotics of \(r(4,t)\), Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\), Unimodular graphs and Eisenstein sums, Energies and structure of additive sets, The phase transition in site percolation on pseudo-random graphs, Large sets in finite fields are sumsets, Counting sum-free sets in abelian groups, Regular Turán numbers of complete bipartite graphs, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, Ramsey numbers involving an odd cycle and large complete graphs in three colors, The Erdős-Hajnal conjecture for three colors and triangles, A note on multicolor Ramsey number of small odd cycles versus a large clique, Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\), Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs, Bipartite Ramsey numbers of \(K_{t,s}\) in many colors, Multicolor Ramsey numbers via pseudorandom graphs, Counting independent sets in graphs, Cayley sum graphs and their applications to codebooks, Independent Sets in Polarity Graphs, Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs, Multicolor bipartite Ramsey number of C4 and large Kn, n, Monochromatic cycle partitions of edge-colored graphs
