Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
For a partially ordered set (A,≤)(A,\le ), let GA{G}_{A} be the simple, undirected graph with vertex set A such that two vertices a≠b∈Aa\ne b\in A are adjacent if either a≤ba\le b or b≤ab\le a. We call GA{G}_{A} the partial order graph or comparability graph of A. Furthermore, we say that a graph G...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2020-12-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/math.2020.18.issue-1/math-2020-0085/math-2020-0085.xml?format=INT |