Fraternal augmentations, arrangeability and linear Ramsey numbers
Fraternal augmentations, arrangeability and linear Ramsey numbers
复制标题
DOI：
10.1016/j.ejc.2009.03.012
复制
发表时间：
2009-10
期刊：
影响因子：
--
通讯作者：
J. Nesetril;P. D. Mendez
中科院分区：
文献类型：
--
作者：
J. Nesetril;P. D. Mendez
We relate the notions of arrangeability and admissibility to bounded expansion classes and prove that these notions can be characterized by ∇1(G). (The Burr–Erdős conjecture relates to ∇0(G).) This implies the linearity of the Ramsey number and the bounded game chromatic number for some new classes of graphs.
