Morphologie des posets (-1)-critiques

Abstract

Let $G=(V,A)$ be a digraph. For $X\subseteq V$, the subdigraph of $G$ induced by $X$ is denoted by $G[X]$. A subset $I$ of $V$ is an interval of $G$ if for every $a,b \in I$ and $x \in V \setminus I$, $(x,a) \in A$ if and only if $(x,b) \in A$, and similarly for $(a,x)$ and $(b,x)$. The trivial intervals of $G$ are $\varnothing$, $V$ and $\lbrace x\rbrace$, where $x\in V$. The digraph $G$ is indecomposable if $| V(G)|\geqslant 3$ and all its intervals are trivial. Given an indecomposable digraph $G$, a vertex $x$ of $G$ is critical, if the induced subdigraph $G[V(G) \setminus \{x\}]$ is decomposable. The digraph $G$ is said to be (-1)-critical if it admits a single non-critical vertex. A poset (or a strict partial order) is a transitive digraph. In this paper, We characterize the (-1)-critical posets.

Figures (7)

• Figure 1: Les posets $Q_{2n}$ et $Q'_{2n}$.
• Figure 2: Le poset (-1)-critique $Q_{2n_1,\ldots, 2n_k}$ (0 est le sommet non critique).
• Figure 3: Le poset (-1)-critique $Q'_{2n_1,\ldots, 2n_k}$ (0 est le sommet non critique).
• Figure 4: Le poset (-1)-critique $R_{1,2n_1,2n_2}$ (0 est le sommet non critique).
• Figure 5: Les graphes $G_1, G_2, G_3, G_4$.

Theorems & Definitions (3)

• Theorem 2.1
• Theorem 2.2
• proof : Preuve