List questions from ramsey-theory

Published on 19 Feb 2021 - 3:18

24

Views

Are Ramsey numbers defined for $n=0$?

Published on 26 Feb 2021 - 23:22

110

Views

Van der Waerden Theorem - Deducing Ackermann function Upper bound

Published on 16 Mar 2021 - 16:32

149

Views

Using Ramsey's Theorem to prove that a graph with $\binom{k+l}{k}$ vertices contains $K_{k+1}$ or $\overline K_{l+1}$

Published on 23 Mar 2021 - 23:47

299

Views

Finding a set of $n-1$ languages, such that everyone speaks at least one language in the set

Published on 24 Mar 2021 - 0:21

101

Views

Question related to Erdös-Szekeres Happy Ending problem

Published on 24 Mar 2021 - 16:01

254

Views

Van der Waerden Number Proof

Published on 25 Mar 2021 - 4:32

88

Views

Order-theoretic tree with infinitely repeating colouring

Published on 28 Mar 2021 - 10:57

145

Views

For what number of $n$ if we partition the edges of the complete graph $K_n$ into $4$ pieces then one of the pieces contains a $K_3$?

Published on 04 Apr 2021 - 17:19

19

Views

Show that if $n \ge R(6,6)$ and we partition the edges of the complete graph $K_n$ into four pieces then one of the pieces contains a traingle.

Published on 11 Apr 2021 - 17:36

60

Views

Turan Construction - Ramsey Theory

Published on 19 Apr 2021 - 2:56

46

Views

Need some clarification on something rather elementary about Ramsey Theory

Published on 28 Apr 2021 - 18:48

12

Views

Lower Bound on R(k,k)

Published on 12 May 2021 - 16:35

257

Views

Show $R(mK_2,mK_2)=3m-1$

Published on 13 May 2021 - 21:04

83

Views

Intersection with any syndetic set is nonempty implies thick

Published on 15 May 2021 - 14:41

List Question

Good reference for values of Ramsey Numbers

Are Ramsey numbers defined for $n=0$?

Van der Waerden Theorem - Deducing Ackermann function Upper bound

Using Ramsey's Theorem to prove that a graph with $\binom{k+l}{k}$ vertices contains $K_{k+1}$ or $\overline K_{l+1}$

Finding a set of $n-1$ languages, such that everyone speaks at least one language in the set

Question related to Erdös-Szekeres Happy Ending problem

Van der Waerden Number Proof

Order-theoretic tree with infinitely repeating colouring

For what number of $n$ if we partition the edges of the complete graph $K_n$ into $4$ pieces then one of the pieces contains a $K_3$?

Show that if $n \ge R(6,6)$ and we partition the edges of the complete graph $K_n$ into four pieces then one of the pieces contains a traingle.

Turan Construction - Ramsey Theory

Need some clarification on something rather elementary about Ramsey Theory

Lower Bound on R(k,k)

Show $R(mK_2,mK_2)=3m-1$

Intersection with any syndetic set is nonempty implies thick

Trending Questions

Popular # Hahtags

Popular Questions