Characterizing subclasses of cover-incomparability graphs by forbidden subposets (Q2314427): Difference between revisions

The cover-incomparability graph of a poset is a graph whose vertex set is the vertex set of the poset and where there is an edge between \(x\) and \(y\) if \(x\) covers \(y\) or \(y\) covers \(x\) or \(x\) and \(y\) are incomparable. The authors consider various statements which have recently been made relating the structure of cover-incomparability graphs to forbidden subposets of the poset. They show that these statements are untrue, the confusion possibly having arisen from confusing two special types of subposet -- the isometric subposets and the weaker notion of \(\prec\)-preserving subposet which has to replace the notion of isometric subposet in the statements. The authors also provide corrected versions of these statements