Results on the small quasi-kernel conjecture
From MaRDI portal
(Redirected from Publication:6041861)
Abstract: A {em quasi-kernel} of a digraph is an independent set such that for every vertex , there exists a directed path with one or two arcs from to a vertex . 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 has a quasi-kernel of size at most . 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 of order , when , we show a stronger result that has a quasi-kernel of size at most , and the bound is sharp.
Recommendations
Cites work
- A note on quasi-kernels in digraphs
- About quasi-kernels in a digraph
- Algorithmic aspects of small quasi-kernels
- Classes of directed graphs
- Claw-free graphs---a survey
- Digraphs
- Disjoint quasi-kernels in digraphs
- scientific article; zbMATH DE number 3465337 (Why is no real title available?)
- On the number of quasi-kernels in digraphs
- Solutions of irreflexive relations
- Split digraphs
- The structure of claw-free graphs
- Threshold graphs and related topics
- Towards the small quasi-kernel conjecture
- Zero-one matrices with zero trace
Cited in
(9)- Towards the small quasi-kernel conjecture
- At least three minimal quasi-kernels
- Strong arc decompositions of split digraphs
- Quasi-kernels in split graphs
- Distant digraph domination
- Generalized quasikernels in digraphs
- A variable version of the quasi-kernel conjecture
- On the small quasi-kernel conjecture -- a survey
- Counterexamples to a problem of spiro on k-kernels
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)