搜索结果: 1-2 共查到“Triangle-free Graphs”相关记录2条 . 查询时间(0.073 秒)
Scott's induced subdivision conjecture for maximal triangle-free graphs
Scott's subdivision conjecture maximal triangle-free graphs Combinatorics
2011/9/14
Abstract: Scott conjectured that the class of graphs with no induced subdivision of a given graph is $\chi$-bounded. We verify his conjecture for maximal triangle-free graphs.
The Fractional Chromatic Number of Triangle-free Graphs with $\Delta\leq 3$
Triangle-free Graphs Combinatorics
2010/11/18
Let $G$ be any triangle-free graph with maximum degree $\Delta\leq 3$. Staton proved that the independence number of $G$ is at least $\frac{5}{14}n$. Heckman and Thomas conjectured that Staton's resul...
