Results on the small quasi-kernel conjecture

From MaRDI portal
(Redirected from Publication:6041861)



Abstract: A {em quasi-kernel} of a digraph D is an independent set QsubseteqV(D) such that for every vertex , there exists a directed path with one or two arcs from v to a vertex uinQ. In 1974, Chv'{a}tal and Lov'{a}sz proved that every digraph has a quasi-kernel. In 1976, ErdH{o}s and S'zekely conjectured that every sink-free digraph D=(V(D),A(D)) has a quasi-kernel of size at most |V(D)|/2. In this paper, we give a new method to show that the conjecture holds for a generalization of anti-claw-free digraphs. For any sink-free one-way split digraph D of order n, when ngeq3, we show a stronger result that D has a quasi-kernel of size at most fracn+32−sqrtn, and the bound is sharp.












This page was built for publication: Results on the small quasi-kernel conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041861)