Title of article
Fraternal augmentations, arrangeability and linear Ramsey numbers
Author/Authors
Ne?et?il، نويسنده , , Jaroslav and Ossona de Mendez، نويسنده , , Patrice، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
1696
To page
1703
Abstract
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.
Journal title
European Journal of Combinatorics
Serial Year
2009
Journal title
European Journal of Combinatorics
Record number
1550258
Link To Document