arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.0552cs.DMmath.CO
收藏

容差图与余可比图的交

On the Intersection of Tolerance and Cocomparability Graphs

George B. Mertzios, Shmuel Zaks

摘要:

Golumbic和Monma在1984年证明了容差图与上可比图的交与有界容差图是一致的。这个猜想已经在输入图上的一些相当强的\emph{structural}假设下得到了证明;特别是,它已经被证明是树的补图,后来扩展到二分图的补图,这些是迄今为止唯一已知的结果。我们在这篇文章中的主要结果是,上述猜想是真的,为每个图$G$,承认公差表示与一个无界顶点;注意,在这里,这个假设只涉及给定的公差\emph{representation} $R$的$G$,而不是任何结构性质的$G$。此外,我们的结果意味着作为一个推论,Golumbic,Monma和Trotter的猜想是真的,对于每个图$G=(V,E)$,没有三个独立的顶点$a,b,c\in V$,使$N(a) \subset N(b) \subset N(c)$ ;这是满足特别是当$G$是一个三角形的图的补充(这也意味着上述的正确性,补充的二分图)。我们的证明是建设性的,在这个意义上说,给定一个图$G$的公差表示$R$,我们将$R$转换成$G$的有界公差表示$R^{\ast}$。此外,我们推测,任何\emph{minimal}公差图$G$,这不是一个有界的公差图,有一个公差表示,只有一个无界顶点。我们的结果意味着非平凡的结果,为了证明Golumbic,Monma和Trotter的猜想,它足以证明我们的猜想。

英文摘要:

It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. The conjecture has been proved under some - rather strong - \emph{structural} assumptions on the input graph; in particular, it has been proved for complements of trees, and later extended to complements of bipartite graphs, and these are the only known results so far. Our main result in this article is that the above conjecture is true for every graph $G$ that admits a tolerance representation with exactly one unbounded vertex; note here that this assumption concerns only the given tolerance \emph{representation} $R$ of $G$, rather than any structural property of $G$. Moreover, our results imply as a corollary that the conjecture of Golumbic, Monma, and Trotter is true for every graph $G=(V,E)$ that has no three independent vertices $a,b,c\in V$ such that $N(a) \subset N(b) \subset N(c)$; this is satisfied in particular when $G$ is the complement of a triangle-free graph (which also implies the above-mentioned correctness for complements of bipartite graphs). Our proofs are constructive, in the sense that, given a tolerance representation $R$ of a graph $G$, we transform $R$ into a bounded tolerance representation $R^{\ast}$ of $G$. Furthermore, we conjecture that any \emph{minimal} tolerance graph $G$ that is not a bounded tolerance graph, has a tolerance representation with exactly one unbounded vertex. Our results imply the non-trivial result that, in order to prove the conjecture of Golumbic, Monma, and Trotter, it suffices to prove our conjecture.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑