Abstract
We investigate classes of graphs and posets that admit decompositions to obtain or disprove finiteness results for obstruction sets. To do so we develop a theory of minimal infinite antichains that allows us to characterize such antichains by means of the set of elements below it.
In particular we show that the following classes have infinite antichains with respect to the induced subgraph/poset relation: interval graphs and orders, N-free orders, orders with bounded decomposition width. On the other hand for orders with bounded decomposition diameter finiteness of all antichains is shown. As a consequence those classes with infinite antichains have undecidable hereditary properties whereas those with finite antichains have fast algorithms for all such properties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abrahamson, K., Dadoun, N., Kirkpatrick, D. G. and Przytycka, T. (1989) A simple parallel tree contraction algorithm, J. Algorithms 10, 287–302.
Arnborg, S., Lagergren, J. and Seese, D. (1991) Easy problems for tree-decomposable graphs, J. Algorithms 12, 308–340.
Booth, K. S. and Luekker, G. S. (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13, 335–379.
Corneil, D. G., Perl, Y. and Stewart, L. (1985) A linear recognition algorithm for cographs, SIAM J. Comput. 14, 926–934.
Courcelle, B. (1992) Graph grammars, monadic second-order logic and the theory of graphs minors, Bull. European Assoc. Theoret. Comput. Sci. 46, 193–226.
Cournier, A. and Habib, M. (1992) An efficient algorithm to recognize prime undirected graphs, in (Mayer, 1992), pp. 212–224. 18th International Workshop WG '92.
Cournier, A. and Habib, M. (1994) A new linear algorithm for modular decomposition, in S. Tison (ed.), 19th International Colloquium CAAP '94, pp. 68–82.
Dahlhaus, E. (1995) Efficient parallel modular decomposition, extended abstract, in Nagl et al. (eds.), Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 1017, pp. 290–302. 21st International Workshop WG '95.
Dahlhaus, E., Gustedt, J. and McConnell, R. (1997) A pratical and efficient algorithm for substitution decomposition, in M. Saks et al. (eds.), Proceedings of the Eighth Annual ACM-SIAMSymposium on Discrete Algorithms, pp. 26–35.
Damaschke, P. (1990) Induced subgraphs and well-quasi-ordering, J. Graph Theory 14(4), 427–435.
FOCS (1985) 26th Annual Symposion On Foundations of Computer Science, IEEE, The Institute of Electrical and Electronics Engineers, IEEE Computer Society Press.
Földes, S. and Hammer, P.L. (1977) Split graphs, in F. Hoffman et al. (eds.), Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge, Louisiana, pp. 311–315.
Gustedt, J. (1993) On the pathwidth of chordal graphs, Discrete Appl. Math. 45(3), 233–248.
Habib, M. and Möhring, R. H. (1987) On some complexity properties of N-free posets and posets with bounded decomposition diameter, Discrete Math. 63, 157–182.
Harrington, L. A. et al. (eds.) (1985) Harvey Friedman' Research on the Foundations of Mathematics, Elsevier Science Publishers B.V., Amsterdam.
Higman, G. (1952) Ordering by divisibility in abstract algebras, Proc. London Math. Soc. 2, 326–336.
Korte, N. and Möhring, R. H. (1989) An incremental linear-time algorithm to recognize interval graphs, SIAM J. Comput. 18, 68–81.
Kříž, I. (1989) Well-quasiordering finite trees with gap-condition, Proof of Harvey Friedman' conjecture, Anal. Math. 130(1), 215–226.
Kruskal, J. B. (1960) Well quasi ordering, the tree theorem and Vazsonyi' conjecture, Trans. Amer. Math. Soc. 95, 210–225.
Kruskal, J. B. (1972) The theory of well-quasi-ordering: A frequently discovered concept, J. Combin. Theory Ser. A 13, 297–305.
Lin, R. and Olariu, S. (1998) A fast parallel algorithm to recognize P4-sparse graphs, Discrete Appl. Math., to appear.
Mayer, E.W. (ed.) (1992) Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 657, Springer-Verlag. 18th International Workshop WG '92.
McConnell, R. M. and Spinrad, J. P. (1994) Linear-time modular decomposition and efficient transitive orientation of undirected graphs, in (Sleator et al., 1994), pp. 536–545.
Miller, G. L. and Reif, J. H. (1985) Parallel tree contraction and its application, in (FOCS, 1985), pp. 478–489.
Milner, E. C. (1985) Basic wqo-and bqo-theory, in (Rival, 1985), pp. 487–502.
Möhring, R. H. (1989) Computationally tractable classes of ordered sets, in (Rival, 1989), pp. 105–194.
Muller, J. H. and Spinrad, J. (1989) Incremental modular decomposition, J. Assoc. Comput. Mach. 36, 1–19.
Nash-Williams, C. S. J. A. (1963) On well-quasi-ordering finite trees,Math. Proc. Cambridge Philos. Soc. 59, 833–835.
Pouzet, M. (1985) Applications of well quasi-ordering and better quasi-ordering, in (Rival, 1985), pp. 503–519.
Rival, I. (ed.) (1985) Graphs and Orders, D. Reidel, Dordrecht.
Rival, I. (ed.) (1989) Algorithms and Order, Kluwer Acad. Publ., Dordrecht.
Robertson, N. and Seymour, P. (1990) Graph minors IV, tree-width and well-quasi-ordering, J. Combin. Theory Ser. B 48(2), 227–254.
Simpson, S. G. (1985) Nonprovability of certain combinatorial properties of finite trees, in (Harrington et al., 1985).
Sleator, D. D. et al. (eds.) (1994) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Society of Industrial and Applied Mathematics.
Tarkowski, S. (1960)- title unknown -, Bull. Acad. Polon. Sci. Sér. Sci. Tech. 8, 39–41. Cited after (Nash-Williams, 1963).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gustedt, J. Finiteness Theorems for Graphs and Posets Obtained by Compositions. Order 15, 203–220 (1998). https://doi.org/10.1023/A:1006209905006
Issue Date:
DOI: https://doi.org/10.1023/A:1006209905006