Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory

Ayman Badawi, Roswitha Rissner

For a partially ordered set $(A,\le )$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a\ne b\in A$ are adjacent if either $a\le b$ or $b…