Finiteness Theorems for Graphs and Posets Obtained by Compositions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Order Year : 1999

Finiteness Theorems for Graphs and Posets Obtained by Compositions

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 infiniteantichains with resp. 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.
Not file

Dates and versions

inria-00098825 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098825 , version 1

Cite

Jens Gustedt. Finiteness Theorems for Graphs and Posets Obtained by Compositions. Order, 1999, 15 (3), pp.203-220. ⟨inria-00098825⟩
83 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More