Sciweavers

792 search results - page 6 / 159
» Constrained Ramsey Numbers
Sort
View
JCT
2006
168views more  JCT 2006»
14 years 11 months ago
Mono-multi bipartite Ramsey numbers, designs, and matrices
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
Paul N. Balister, András Gyárf&aacut...
51
Voted
JCT
2006
69views more  JCT 2006»
14 years 11 months ago
The Ramsey number for hypergraph cycles I
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojt...
53
Voted
ENDM
2007
62views more  ENDM 2007»
14 years 11 months ago
Ramsey numbers of sparse hypergraphs
Daniela Kühn, Oliver Cooley, Nikolaos Fountou...
ENDM
2007
96views more  ENDM 2007»
14 years 11 months ago
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
Jacob Fox, Veselin Jungic, Rados Radoicic
JGT
2007
43views more  JGT 2007»
14 years 11 months ago
Tripartite Ramsey numbers for paths
András Gyárfás, Miklós...