Related papers: Infinite monochromatic paths and a theorem of Erdo…

We prove that if cf(lambda) > aleph_0 and 2^{cf(lambda)}<lambda, then lambda->(lambda,omega+1)^2.

We prove the consistency of $\binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+ \omega_1}{\mu\ \mu}$ where $\mu$ is a strong limit singular cardinal of countable cofinality. This result can be forced at limit of measurable cardinals and at small…

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

We establish a coloring theorem for successors of a singular cardinals, and use it prove that for any such cardinal $\mu$, we have $\mu^+\nrightarrow[\mu^+]^2_{\mu^+}$ if and only if $\mu^+\nrightarrow[\mu^+]^2_{\theta}$ for arbitrarily…

Erdos, Hajnal and Rado asked whether $\binom{\aleph_{\omega_1}}{\aleph_2}\rightarrow\binom{\aleph_{\omega_1}}{\aleph_0}_2$ and whether $\binom{\aleph_{\omega_1}}{\aleph_2}\rightarrow\binom{\aleph_{\omega_1}}{\aleph_1}_2$. We prove that both…

Let kappa be an uncountable cardinal and the edges of a complete graph with kappa vertices be colored with aleph_0 colors. For kappa >2^{aleph_0} the Erd\H{o}s-Rado theorem implies that there is an infinite monochromatic subgraph. However,…

Let $\mu$ be a strong limit singular cardinal. We prove that if $2^{\mu} > \mu^+$ then $\binom{\mu^+}{\mu}\to \binom{\tau}{\mu}_{<{\rm cf}(\mu)}$ for every ordinal $\tau<\mu^+$. We obtain an optimal positive relation under $2^\mu = \mu^+$,…

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

Let $f$ be a $C^{1+\alpha}$ diffeomorphism of a compact manifold $M$ preserving a smooth measure $\mu$. We show that if $f:(M,\mu)\to (M,\mu)$ is exponentially mixing then it is Bernoulli.

We obtain an improvement of some coloring theorems from \cite{nsbpr}, \cite{819}, and \cite{APAL} for the case where the singular cardinal in question has countable cofinality. As a corollary, we obtain an "idealized" version of the…

Answering a question raised by Dudek and Pra\l{}at, we show that if $pn\rightarrow \infty$, w.h.p.,~whenever $G=G(n,p)$ is $2$-coloured, there exists a monochromatic path of length $n(2/3+o(1))$. This result is optimal in the sense that…

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring, or equivalently, $t_H(W)+t_H(1-W)\geq 2^{1-e(H)}$ holds for…

A double star is a tree with two internal vertices. It is known that the Gy\'arf\'as-Sumner conjecture holds for double stars, that is, for every double star $H$, there is a function $f$ such that if $G$ does not contain $H$ as an induced…

We prove for any mu = mu^{< mu}< theta < lambda, lambda large enough (just strongly inaccessible Mahlo) the consistency of 2^mu = lambda-> [theta]^2_3 and even 2^mu = lambda-> [theta]^2_{sigma,2} for sigma < mu . The new point is that…

We prove the consistency of the statement $\mathfrak{u}_{\aleph_\omega}<2^{\aleph_\omega}$. We show that the consistency strength of this statement is exactly a measurable cardinal $\mu$ so that $o(\mu)=\mu^{++}$.

A graph G is H-free if it has no induced subgraph isomorphic to H. We prove that a $P_5$-free graph with clique number $\omega\ge 3$ has chromatic number at most $\omega^{\log_2(\omega)}$. The best previous result was an exponential upper…

Addressing a question of Erdos and Hajnal we show that one can force a graph with no large independent sets and no monochromatic triples as successors of strong limit singular cardinals, even without assuming GCH. The result can be pushed…

The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\binom{n-1}{k-1}$. The theorem also…

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

Erd\H{o}s and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at least 1/2log(n) vertices. The famous Erd\H{o}s-Hajnal…