arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.0404math.COcs.DM
收藏

无诱导四边路或四边反路的图的单纯点及$H_6$ -猜想

Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the $H_6$-conjecture

Maria Chudnovsky, Peter Maceli

摘要:

设$\mathcal{G}$是所有没有导出四边路或四边反路的图的类。Hayward和Naidian \cite{MS}证明了$\mathcal{G}$中不同构于长度为5的圈的每一个素图要么是分裂图,要么包含某种有用的单纯顶点和反单纯顶点的排列。本文给出了他们猜想的一个反例,并证明了一个较弱的版本。此外,应用第一作者和Seymour \cite{grow}的一个结果,我们给出了Fouquet关于$\mathcal{G}$中包含的无牛图子类的结构的结果\cite{C5}的一个简短证明.

英文摘要:

Let $\mathcal{G}$ be the class of all graphs with no induced four-edge path or four-edge antipath. Hayward and Nastos \cite{MS} conjectured that every prime graph in $\mathcal{G}$ not isomorphic to the cycle of length five is either a split graph or contains a certain useful arrangement of simplicial and antisimplicial vertices. In this paper we give a counterexample to their conjecture, and prove a slightly weaker version. Additionally, applying a result of the first author and Seymour \cite{grow} we give a short proof of Fouquet's result \cite{C5} on the structure of the subclass of bull-free graphs contained in $\mathcal{G}$.

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

↑