Disproving the Normal Graph Conjecture
Journal of combinatorial theory Series B(2021)
摘要
A graph G is called normal if there exist two coverings, C and S of its vertex set such that every member of C induces a clique in G, every member of S induces an independent set in G and C∩S≠∅ for every C∈C and S∈S. It has been conjectured by De Simone and Körner in 1999 that a graph G is normal if G does not contain C5, C7 and C7‾ as an induced subgraph. We disprove this conjecture.
更多查看译文
关键词
Normal graphs,Perfect graphs,Random graphs,Probabilistic method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要