an:05030999
Zbl 1089.05025
Ne??et??il, Jaroslav; Ossona de Mendez, Patrice
Tree-depth, subgraph coloring and homomorphism bounds
EN
Eur. J. Comb. 27, No. 6, 1022-1041 (2006).
00126396
2006
j
05C15 05C83
chromatic number; graph partitions; minor closed class; decomposition
Summary: We define the notions tree-depth and upper chromatic number of a graph and show their relevance to local-global problems for graph partitions. In particular we show that the upper chromatic number coincides with the maximal function which can be locally demanded in a bounded coloring of any proper minor closed class of graphs. The rich interplay of these notions is applied to a solution of bounds of proper minor closed classes satisfying local conditions. In particular, we prove the following result: For every graph \(M\) and finite set \(\mathcal F\) of connected graphs there exists a (universal) graph \(U = U(M, \mathcal F)\in \mathrm{Forb}_{\mathrm h}(\mathcal F)\) such that any graph \(G \in \mathrm{Forb}_{\mathrm h}(\mathcal F)\) which does not have \(M\) as a minor satisfies \(G\rightarrow U\) (i.e. is homomorphic to \(U\)).
This solves the main open problem of restricted dualities for minor closed classes and as an application it yields the bounded chromatic number of exact odd powers of any graph in an arbitrary proper minor closed class. We also generalize the decomposition theorem of \textit{M. DeVos, G. Ding, B. Oporowski, D. P. Sanders, B. Reed, P. Seymour}, and \textit{D. Vertigan} [J. Comb. Theory, Ser. B 91; 25--41 (2004; Zbl 1042.05036)].
Zbl 1042.05036