List questions from ramsey-theory

Published on 14 Apr 2026 - 6:49

533

Views

Lower bound for diagonal Ramsey numbers

Published on 14 Apr 2026 - 6:57

538

Views

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

Published on 13 Apr 2026 - 20:55

132

Views

Proof of familiarity between 9 people

Published on 10 Apr 2026 - 19:00

145

Views

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

Published on 17 Apr 2026 - 5:23

95

Views

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

Published on 15 Apr 2026 - 22:34

356

Views

Ramsey numbers lower bound

Published on 14 Apr 2026 - 5:37

89

Views

Generalized Ramsey numbers, possibly infinite?

Published on 10 May 2026 - 16:09

193

Views

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

Published on 10 May 2026 - 14:39

141

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 17 Apr 2026 - 8:03

321

Views

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

Published on 16 Apr 2026 - 1:38

93

Views

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

Published on 17 Apr 2026 - 2:12

86

Views

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

Published on 15 Apr 2026 - 9:15

239

Views

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

Published on 25 Mar 2026 - 7:43

293

Views

Proof of the Infinite Ramsey Theorem

Published on 12 Apr 2026 - 1:44

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