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

From MaRDI portal
Publication:2053552

DOI10.1515/MATH-2020-0085zbMATH Open1487.05172arXiv2002.07134OpenAlexW3125937266WikidataQ114052851 ScholiaQ114052851MaRDI QIDQ2053552FDOQ2053552

Ayman Badawi, Roswitha Rissner

Publication date: 29 November 2021

Published in: Open Mathematics (Search for Journal in Brave)

Abstract: For a partially ordered set (A,le), let GA be the simple, undirected graph with vertex set A such that two vertices aeqbinA are adjacent if either aleb or blea. We call GA the emph{partial order graph} or emph{comparability graph} of A. Further, we say that a graph G is a partial order graph if there exists a partially ordered set A such that G=GA. For a class mathcalC of simple, undirected graphs and n, mge1, we define the Ramsey number mathcalRmathcalC(m,n) with respect to mathcalC to be the minimal number of vertices r such that every induced subgraph of an arbitrary partial order graph consisting of r vertices contains either a complete n-clique Kn or an independent set consisting of m vertices. In this paper, we determine the Ramsey number with respect to some classes of partial order graphs. Furthermore, some implications of Ramsey numbers in ring theory are discussed.


Full work available at URL: https://arxiv.org/abs/2002.07134





Cites Work


Cited In (1)






This page was built for publication: Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053552)