List questions from ramsey-theory

Published on 20 Nov 2015 - 20:39

236

Views

Asymptotic lower bound for R(k,k)

Published on 22 Nov 2015 - 14:47

114

Views

Aplication of Ramsey theory in group theory

Published on 23 Nov 2015 - 20:28

205

Views

A Ramsey not Completely Ramsey Set of $[\omega]^\omega$.

Published on 23 Nov 2015 - 23:52

317

Views

Find maximal clique in an multigraph with $n$ vertices, where each vertex is colored with $k$ colors.

Published on 27 Nov 2015 - 0:09

95

Views

Finite coloring of $[\omega]^{<\omega}$.

Published on 28 Nov 2015 - 18:11

436

Views

Proof involving Ramsey numbers

Published on 01 Dec 2015 - 3:08

127

Views

Finding the exact value for $H(7)$

Published on 01 Dec 2015 - 15:55

112

Views

Maximum $K_6$-free graph on $15$ vertices?

Published on 04 Dec 2015 - 18:25

83

Views

Independent Set of Product Graph and Ramsey Number

Published on 06 Dec 2015 - 2:03

104

Views

Ramsey number for tree and complete graph

Published on 07 Dec 2015 - 18:57

983

Views

Infinitely many points in plane s.t. no point is a convex combination of other points

Published on 15 Dec 2015 - 18:24

948

Views

Lower bound for Ramsey numbers: $R( n + 2 , 3 )>3n$

Published on 01 Jan 2016 - 15:28

829

Views

in every coloring $1,...,n$ there are distinct integers $a,b,c,d$ such that $a+b+c=d$

Published on 04 Jan 2016 - 10:13

49

Views

Monochromatic triangle in two closed set which cover the plane

Published on 07 Jan 2016 - 6:05

List Question

Number of edges needed for good colouring in Ramsey graph theory

Asymptotic lower bound for R(k,k)

Aplication of Ramsey theory in group theory

A Ramsey not Completely Ramsey Set of $[\omega]^\omega$.

Find maximal clique in an multigraph with $n$ vertices, where each vertex is colored with $k$ colors.

Finite coloring of $[\omega]^{<\omega}$.

Proof involving Ramsey numbers

Finding the exact value for $H(7)$

Maximum $K_6$-free graph on $15$ vertices?

Independent Set of Product Graph and Ramsey Number

Ramsey number for tree and complete graph

Infinitely many points in plane s.t. no point is a convex combination of other points

Lower bound for Ramsey numbers: $R( n + 2 , 3 )>3n$

in every coloring $1,...,n$ there are distinct integers $a,b,c,d$ such that $a+b+c=d$

Monochromatic triangle in two closed set which cover the plane

Trending Questions

Popular # Hahtags

Popular Questions