Skip to main content

All Questions

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
12 votes
0 answers
240 views

Does $2^{\aleph_0}\rightarrow [\aleph_1]^2_3$ require that the continuum is weakly inaccessible?

A classic result of Sierpiński shows that $2^{\aleph_0}\nrightarrow [\aleph_1]^2_2$, that is, there is a coloring of pairs of real numbers using two colors such that both colors appear on any ...
Todd Eisworth's user avatar
3 votes
0 answers
176 views

Ramsey's infinite principle and the axiom of choice

Frank Plumpton Ramsey, best known for giving his name to Ramsey Theory, presented the following theorem in On a Problem of Formal Logic, that was submitted in 1928 and published posthumously. Let $\...
Brendan McKay's user avatar
1 vote
0 answers
95 views

A two-colouring of a complete graph over the set of incompressible strings

A two-coloring is done over the (infinite) set all incompressible strings (in some chosen alphabet); such that, an edge between two strings is blue if and only if, the strings are of equal lengths and ...
ARi's user avatar
  • 851
1 vote
0 answers
99 views

Group graphs and Ramsey theory. Sub-question 1

Question: Find/compute relations between the classical Ramsey numbers and their variations (described below) -- exact or asymptotic. A graph is a set $\ X\ $ together with a (coloring) function $\ c:\...
Wlod AA's user avatar
  • 4,776