An antichain A of a well-founded quasi-order Q is canonical if for every ideal F of Q, F has an infinite antichain if and only if F ∩ A is infinite. In this paper we characterize the obstructions to having a canonical antichain. As an application we show that, under the induced subgraph relation, the class of finite graphs does not have a canonical antichain. In contrast, this class does have a canonical antichain with respect to the subgraph relation. © 2008 Elsevier B.V. All rights reserved
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
The main result of this paper is that all antichains are finite in the poset of monomial ideals in ...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
AbstractAn antichain A of a well-founded quasi-order Q is canonical if for every ideal F of Q, F has...
AbstractAn antichain A of a well-founded quasi-order Q is canonical if for every ideal F of Q, F has...
AbstractWe investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a wel...
We study unit interval graphs and bipartite permutation graphs partially ordered by the induced subg...
A class of finite tournaments determined by a set of "forbidden subtournaments" is wellqua...
Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none ...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
Article dans revue scientifique avec comité de lecture.We investigate classes of graphs and posets t...
We investigate classes of graphs and posets that admit decompositions to obtain or disprove finitene...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
The main result of this paper is that all antichains are finite in the poset of monomial ideals in ...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
AbstractAn antichain A of a well-founded quasi-order Q is canonical if for every ideal F of Q, F has...
AbstractAn antichain A of a well-founded quasi-order Q is canonical if for every ideal F of Q, F has...
AbstractWe investigate the minimal antichains (in what is essentially Nash-Williams' sense) in a wel...
We study unit interval graphs and bipartite permutation graphs partially ordered by the induced subg...
A class of finite tournaments determined by a set of "forbidden subtournaments" is wellqua...
Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none ...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
Article dans revue scientifique avec comité de lecture.We investigate classes of graphs and posets t...
We investigate classes of graphs and posets that admit decompositions to obtain or disprove finitene...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
The main result of this paper is that all antichains are finite in the poset of monomial ideals in ...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...