On covering intersecting set-systems by digraphs (Q5936065)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On covering intersecting set-systems by digraphs |
scientific article; zbMATH DE number 1612926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On covering intersecting set-systems by digraphs |
scientific article; zbMATH DE number 1612926 |
Statements
On covering intersecting set-systems by digraphs (English)
0 references
2 July 2001
0 references
The author presents a common generalization of a theorem of Edmonds on the number of disjoint branchings, and a theorem of Frank on kernel systems.
0 references
digraphs
0 references
aborescence
0 references
covering
0 references
branchings
0 references
kernel systems
0 references
