List questions from ramsey-theory

Published on 04 May 2019 - 16:52

530

Views

Lower bound for diagonal Ramsey numbers

Published on 06 May 2019 - 19:40

535

Views

If $K_{14}$ is colored with two colors, there will be a monochromatic quadrangle.

Published on 10 May 2019 - 13:13

129

Views

Proof of familiarity between 9 people

Published on 16 May 2019 - 11:42

142

Views

Prove $R(t,t) \ge 2^{t/2}$ for all $t\ge 3$

Published on 20 May 2019 - 19:09

92

Views

Bounding the number of edges in a graph satisfying a certain property

Published on 21 May 2019 - 18:03

352

Views

Ramsey numbers lower bound

Published on 29 May 2019 - 14:33

87

Views

Generalized Ramsey numbers, possibly infinite?

Published on 23 Mar 2026 - 3:46

192

Views

How do I apply the infinite Ramsey theorem to graph theory?

Published on 25 Mar 2026 - 7:43

138

Views

The minimum over all possible graph with n vertices of the multiplication of the clique and anticlique number is less than n

Published on 01 Jun 2019 - 0:53

318

Views

Ramsey number: why is R(s, t)=R(t, s)?

Published on 10 Jun 2019 - 7:15

90

Views

Which part of Ramsey theorem denotes or implies that R(m,n) = R(n,m)?

Published on 13 Jun 2019 - 23:25

83

Views

In every coloring in two colors of the edges of $K_{10} $ there are at least 20 monochromatic triangles.

Published on 15 Jun 2019 - 20:50

239

Views

How to see if a graph with two coloring has a monochromatic triangle?

Published on 25 Mar 2026 - 7:43

289

Views

Proof of the Infinite Ramsey Theorem

Published on 18 Jun 2019 - 12:46

List Question

Ramsey Number on R3

Lower bound for diagonal Ramsey numbers

If $K_{14}$ is colored with two colors, there will be a monochromatic quadrangle.

Proof of familiarity between 9 people

Prove $R(t,t) \ge 2^{t/2}$ for all $t\ge 3$

Bounding the number of edges in a graph satisfying a certain property

Ramsey numbers lower bound

Generalized Ramsey numbers, possibly infinite?

How do I apply the infinite Ramsey theorem to graph theory?

The minimum over all possible graph with n vertices of the multiplication of the clique and anticlique number is less than n

Ramsey number: why is R(s, t)=R(t, s)?

Which part of Ramsey theorem denotes or implies that R(m,n) = R(n,m)?

In every coloring in two colors of the edges of $K_{10} $ there are at least 20 monochromatic triangles.

How to see if a graph with two coloring has a monochromatic triangle?

Proof of the Infinite Ramsey Theorem

Trending Questions

Popular # Hahtags

Popular Questions