Partition relations on a plain product order type (Q861822)

Let \(\tau\) be the order type \(\omega^*\bullet \omega_1\) (of the set \(\omega_1\times \omega\) with lexicographic ordering). It can be visualized as an increasing sequence of \(\omega_1\) columns, each of which is an infinite decreasing sequence. The partition relation \(\tau\to\) (\(\tau\), infinite path)\(^2\) means that every graph on a vertex set of order type \(\tau\) either has an independent subset of the same order type or has an infinite path. A proof, with \(\diamondsuit\), of \(\omega^*\bullet\omega_1\to\) (\(\omega^*\bullet\omega_1\), infinite path)\(^2\) is included in this note. In Theorem 3.4 the author shows: Assume Martin's axiom \(\text{MA}(\aleph_1)\). Then \(\omega^*\bullet\omega_1\to\) (\(\omega^*\bullet\omega_1\), infinite path)\(^2\). Section 4 considers embedding a large part of an arbitrary graph on \(\omega_1\times\omega\) with no infinite path in the comparability graph of a tree. Section 5 contains the theorem: Assume \({\mathfrak c}>\aleph_1\). For any graph \(G= (\omega_1\times\omega,E)\) with no infinite path there is a subset \(V\subseteq\omega_1\times\omega\) so that there are only finitely many edges between any two columns of \(V\).