论文信息 - The TreeWidth Compactness Theorem for Hypergraphs

The TreeWidth Compactness Theorem for Hypergraphs

A hypergraph H has tree-width k (a notion introduced by Robertson and Seymour) if k is the least integer such that H admits a tree-decomposition of tree-width k. We prove a compactness theorem for this notion, that is, if every finite subhypergraph of H has tree-width < k, then H itself has tree-width < k. This result will be used in a later paper on well-quasi-ordering infinite graphs.

Robin Thomas | Robin Thomas | R. Thomas

[1] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[2] C. Nash-Williams. On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[3] Robin Thomas,et al. Well-quasi-ordering infinite graphs with forbidden finite planar minor , 1989 .

[4] Paul D. Seymour,et al. Graph minors. IV. Tree-width and well-quasi-ordering , 1990, J. Comb. Theory, Ser. B.

[5] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .