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

The authors here determine the Ramsey number of partial order graphs. For a partially ordered set $(A,\leq)$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a\neq b\in A$ are adjacent if either $a\leq b$ or $b\leq a$. They call $G_A$ the partial order graph (comparability graph) of $A$. Also, they call a graph $G$ a partial order graph if there exists a partially ordered set $A$ such that $G = G_A$. For a class of simple, undirected graphs and $n$, $m\geq 1$, they defined the Ramsey number $R_C(n, m)$ with respect to the class $C$ to be the minimal number $r$ of vertices such that every induced subgraph of an arbitrary graph of $r$ vertices contains either a complete $n$-clique $K_n$ or an independent set consisting of $m$ vertices. They show that the Ramsey number $R_{\mathrm{PoG}}(n,m)$ for the class $\mathrm{PoG}$ of partial order graphs equals $(n- m)(m-1)+1$. They also study subclasses of partial order graphs that appear in the context of ring theory. They establish that for the classes PDG of perfect divisor graphs, DivG of divisibility graphs, IDG of inclusion ideal graphs, MATG of matrix graphs, and IdemG of idempotent graphs of rings, the respective Ramsey numbers equal to $R_{\mathrm{PoG}}$. The authors also present a subclass of partial ordered graphs with respect to which the Ramsey numbers are non-symmetric.