Fractional kernels in digraphs (Q1366601)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1060743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fractional kernels in digraphs |
scientific article; zbMATH DE number 1060743 |
Statements
Fractional kernels in digraphs (English)
0 references
15 September 1997
0 references
We define a fractional version of the notion of ``kernels'' in digraphs, and prove that every clique-acyclic digraph (i.e., one in which no clique contains a cycle) has a fractional kernel. Using this we give a short proof of the recent result of Boros and Gurvich (proving a conjecture of Berge and Duchet) that every clique-acyclic orientation of a perfect graph has a kernel.
0 references
digraph
0 references
fractional kernel
0 references
perfect graph
0 references
0.8408575654029846
0 references
0.8250753283500671
0 references
0.8223155736923218
0 references
0.812096893787384
0 references
