Search Sciweavers | Sciweavers

266 search results - page 12 / 54

» Chromatic Ramsey numbers

click to vote

JCT
2006

168views more JCT 2006»

Mono-multi bipartite Ramsey numbers, designs, and matrices

13 years 7 months ago

Download www.users.muohio.edu

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...

claim paper

Read More »

click to vote

JCT
2006

69views more JCT 2006»

The Ramsey number for hypergraph cycles I

13 years 7 months ago

Download www.maths.lse.ac.uk

Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojt...

claim paper

Read More »

click to vote

ENDM
2007

62views more ENDM 2007»

Ramsey numbers of sparse hypergraphs

13 years 7 months ago

Download www.math.ucla.edu

Daniela Kühn, Oliver Cooley, Nikolaos Fountou...

claim paper

Read More »

click to vote

ENDM
2007

56views more ENDM 2007»

Constrained Ramsey Numbers

13 years 7 months ago

Download www.math.cmu.edu

Po-Shen Loh, Benny Sudakov

claim paper

Read More »

click to vote

ENDM
2007

96views more ENDM 2007»

Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples

13 years 7 months ago

Download www.emis.de

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

claim paper

Read More »

« Prev « First page 12 / 54 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers