Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Orthogonality between acyclic subdigraphs and paths in digraphs

Caroline A. de Paula Silva, Cândida Nunes da Silva, Orlando Lee

Abstract

Let $D$ be a digraph. A collection of disjoint sets of vertices (respec., collection of disjoint subdigraphs) $\mathcal{H}$ of $D$ and a vertex subset (or subdigraph) $Q$ of $D$ are orthogonal if every set (respec., subdigraph) $H \in \mathcal{H}$ contains exactly one vertex of $Q$. A well-known result of Gallai and Milgram shows that for every minimum path partition of a digraph there is a stable set orthogonal to it. Similarly, Gallai, Hasse, Roy and Vitaver independently proved that for every longest path of a digraph there is a vertex partition into stable sets (i.e, vertex-coloring) orthogonal to it. Berge showed that no analogous statements hold when optimality is required for the stable set or the vertex coloring. In this paper, we show that this holds if we replace stable sets by induced acyclic subdigraphs. In 1981, Linial proposed two generalizations of Gallai-Milgram and Gallai-Hasse-Roy-Vitaver results using a positive integer $k$ as a measure of optimality for the path partition and the coloring, respectively. These generalizations have led to two conjectures that remain open. Using the same strategy of replacing stable sets by induced acyclic subdigraphs, we prove relaxations of both conjectures.

Orthogonality between acyclic subdigraphs and paths in digraphs

Abstract

Let be a digraph. A collection of disjoint sets of vertices (respec., collection of disjoint subdigraphs) of and a vertex subset (or subdigraph) of are orthogonal if every set (respec., subdigraph) contains exactly one vertex of . A well-known result of Gallai and Milgram shows that for every minimum path partition of a digraph there is a stable set orthogonal to it. Similarly, Gallai, Hasse, Roy and Vitaver independently proved that for every longest path of a digraph there is a vertex partition into stable sets (i.e, vertex-coloring) orthogonal to it. Berge showed that no analogous statements hold when optimality is required for the stable set or the vertex coloring. In this paper, we show that this holds if we replace stable sets by induced acyclic subdigraphs. In 1981, Linial proposed two generalizations of Gallai-Milgram and Gallai-Hasse-Roy-Vitaver results using a positive integer as a measure of optimality for the path partition and the coloring, respectively. These generalizations have led to two conjectures that remain open. Using the same strategy of replacing stable sets by induced acyclic subdigraphs, we prove relaxations of both conjectures.
Paper Structure (3 sections, 8 theorems, 2 equations, 1 figure)

This paper contains 3 sections, 8 theorems, 2 equations, 1 figure.

Table of Contents

  1. Introduction
  2. Answering Questions \ref{['question:new-alpha']} and \ref{['question:new-chi']}
  3. Linial's Conjectures

Key Result

Theorem 1.1

Let $D$ be a digraph. For every minimum path partition $\mathcal{P}$ of $D$, there exists a stable set $S$ of $D$ such that $\mathcal{P}$ and $S$ are orthogonal. In particular, $\pi(D) \leq \alpha(D)$.

Figures (1)

  • Figure 1: Orientation $D$ of a $C_5$ that is a counterexample to both Question \ref{['question:alpha']} and Question \ref{['question:chi']}.

Theorems & Definitions (14)

  • Theorem 1.1: Gallai-Milgram's Theorem
  • Theorem 1.2: Gallai-Hasse-Roy- Vitaver's Theorem
  • Conjecture 1.3: Linial
  • Conjecture 1.4: Linial
  • Theorem 1.5
  • Theorem 2.1: Hall's Theorem
  • Lemma 2.2
  • proof
  • Lemma 2.3
  • proof
  • ...and 4 more