Article Dans Une Revue European Journal of Combinatorics Année : 2009

Fraternal augmentations, arrangeability and linear Ramsey numbers

Résumé

We relate the notions of arrangeability and admissibility to bounded expansion classes and prove that these notions can be characterized by nabla_1(G). (The Burr–Erdős conjecture relates to nabla_0(G).) This implies the linearity of the Ramsey number and the bounded game chromatic number for some new classes of graphs.

Dates et versions

hal-00429952 , version 1 (05-11-2009)

Identifiants

Citer

Jaroslav Nesetril, Patrice Ossona de Mendez. Fraternal augmentations, arrangeability and linear Ramsey numbers. European Journal of Combinatorics, 2009, 30 (7), pp.1696-1703. ⟨10.1016/j.ejc.2009.03.012⟩. ⟨hal-00429952⟩

Collections

115 Consultations
0 Téléchargements

Altmetric

Partager

  • More