Question

Show that no matter how we colour all edges of K5,5 with red and blue you can find a copy of K2,2 which either has all edges red or all edges blue.

score 737 · Answer 1 · 2020-12-11 19:50:21

737

Views

Show that no matter how we colour all edges of K5,5 with red and blue you can find a copy of K2,2 which either has all edges red or all edges blue.

Published on 11 Dec 2020 - 19:50

score 80 · Answer 2 · 2020-12-11 22:04:41

80

Views

Is there a way to show R2(s + 1, t + 1) > s · t .

Published on 11 Dec 2020 - 22:04

score 1.1k · Answer 3 · 2026-03-27 03:00:02

1.1k

Views

off diagonal Ramsey number (4,k) lower bound probabilistic method asymptotic reasoning

Published on 27 Mar 2026 - 3:00

score 2.8k · Answer 4 · 2020-12-25 10:55:27

2.8k

Views

Graph Theory: Prove Ramsey Number $R(3, 4)=9$

Published on 25 Dec 2020 - 10:55

score 356 · Answer 5 · 2020-12-25 19:45:13

356

Views

why is the Ramsey number $R(3,4)$ not equal to $R(3,3)$?

Published on 25 Dec 2020 - 19:45

score 88 · Answer 6 · 2020-12-27 17:12:12

88

Views

How does Ramsey Theory relate to Godel Incompleteness theorem?

Published on 27 Dec 2020 - 17:12

score 281 · Answer 7 · 2020-12-27 18:55:36

281

Views

Is there a Ramsey's theorem equivalent for vertex colorings?

Published on 27 Dec 2020 - 18:55

score 250 · Answer 8 · 2021-01-05 21:05:02

250

Views

Lower bound for $R(5, 5)$ cyclic coloring

Published on 05 Jan 2021 - 21:05

score 242 · Answer 9 · 2021-01-13 16:59:42

242

Views

Visualizing lower bound for the Happy Ending Problem (small cases).

Published on 13 Jan 2021 - 16:59

score 220 · Answer 10 · 2021-01-19 15:29:37

220

Views

Equivalence of two version of the Central sets theorem.

Published on 19 Jan 2021 - 15:29

score 108 · Answer 11 · 2021-01-21 04:17:25

108

Views

Prove that there exists a monochromatic shape in $K_{17}$ with each edge being one of 4 different colours

Published on 21 Jan 2021 - 4:17

score 101 · Answer 12 · 2021-01-30 05:15:28

101

Views

Proof related to Ramsey number

Published on 30 Jan 2021 - 5:15

score 276 · Answer 13 · 2021-02-07 19:15:12

276

Views

What is the lower bound of $k$ such that any $k$-regular graph $G$ on $n$ vertices contains a $t$-clique?

Published on 07 Feb 2021 - 19:15

score 230 · Answer 14 · 2021-02-11 18:06:22

230

Views

Schur Theorem implies Finite Schur Theorem

Published on 11 Feb 2021 - 18:06

score 137 · Answer 15 · 2021-02-12 18:37:08

137

Views

Prove that $r_{k+1}(3) \leq (k+1)( r_k(3) - 1) + 2$

Published on 12 Feb 2021 - 18:37

List Question

Show that no matter how we colour all edges of K5,5 with red and blue you can find a copy of K2,2 which either has all edges red or all edges blue.

Is there a way to show R2(s + 1, t + 1) > s · t .

off diagonal Ramsey number (4,k) lower bound probabilistic method asymptotic reasoning

Graph Theory: Prove Ramsey Number $R(3, 4)=9$

why is the Ramsey number $R(3,4)$ not equal to $R(3,3)$?

How does Ramsey Theory relate to Godel Incompleteness theorem?

Is there a Ramsey's theorem equivalent for vertex colorings?

Lower bound for $R(5, 5)$ cyclic coloring

Visualizing lower bound for the Happy Ending Problem (small cases).

Equivalence of two version of the Central sets theorem.

Prove that there exists a monochromatic shape in $K_{17}$ with each edge being one of 4 different colours

Proof related to Ramsey number

What is the lower bound of $k$ such that any $k$-regular graph $G$ on $n$ vertices contains a $t$-clique?

Schur Theorem implies Finite Schur Theorem

Prove that $r_{k+1}(3) \leq (k+1)( r_k(3) - 1) + 2$

Trending Questions

Popular # Hahtags

Popular Questions