搜索结果: 1-1 共查到“组合数学 subdivision conjecture”相关记录1条 . 查询时间(0.015 秒)
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.