A family of counterexamples for a conjecture of Berge on α-diperfect digraphs

Let D be a digraph. A stable set S of D and a path partition 𝒫 of D are orthogonal if every path P ∈𝒫 contains exactly one vertex of S. In 1982, Berge defined the class of α-diperfect digraphs. A digraph D is α-diperfect if for every maximum stable set S of D there is a path partition 𝒫 of D orthogonal to S and this property holds for every induced subdigraph of D. An anti-directed odd cycle is an orientation of an odd cycle (x_0,…,x_2k,x_0) with k≥2 in which each vertex x_0,x_1,x_2,x_3,x_5,x_7…,x_2k-1 is either a source or a sink. Berge conjectured that a digraph D is α-diperfect if and only if D does not contain an anti-directed odd cycle as an induced subdigraph. In this paper, we show that this conjecture is false by exhibiting an infinite family of orientations of complements of odd cycles with at least seven vertices that are not α-diperfect.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2021

Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions

Let D be a digraph and let λ(D) denote the number of vertices in a longe...
research
09/13/2022

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P_4

An oriented graph is a digraph that does not contain a directed cycle of...
research
11/19/2019

On the path partition number of 6-regular graphs

A path partition (also referred to as a linear forest) of a graph G is a...
research
06/03/2018

Short rainbow cycles in sparse graphs

Let G be a simple n-vertex graph and c be a colouring of E(G) with n col...
research
11/03/2020

The Complexity of Finding Fair Independent Sets in Cycles

Let G be a cycle graph and let V_1,…,V_m be a partition of its vertex se...
research
07/25/2022

Results on the Small Quasi-Kernel Conjecture

A quasi-kernel of a digraph D is an independent set Q⊆ V(D) such that fo...
research
08/05/2023

Kalai's 3^d-conjecture for unconditional and locally anti-blocking polytopes

Kalai's 3^d-conjecture states that every centrally symmetric d-polytope ...

Please sign up or login with your details

Forgot password? Click here to reset