Directed cut transversal packing for source-sink connected graphs (Q1101126)
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: Directed cut transversal packing for source-sink connected graphs |
scientific article; zbMATH DE number 4045776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Directed cut transversal packing for source-sink connected graphs |
scientific article; zbMATH DE number 4045776 |
Statements
Directed cut transversal packing for source-sink connected graphs (English)
0 references
1987
0 references
A proof is given for the side coboundaries of a graph concerning the conjecture that in every directed graph, a maximum packing of directed cut transversals is equal in cardinality to a minimum directed cut. It first reduces the problem to a packing theorem for bi-transversals, and then constructs a packing of bi-transversals of the required size, one edge at a time, by maintaining a Hall-like feasibility condition as each edge is added.
0 references
directed graph
0 references
maximum packing of directed cut transversals
0 references
minimum directed cut
0 references
0 references
0.87317586
0 references
0 references
0.86376375
0 references
0 references
0.8632041
0 references
0.8631846
0 references
