On a class of balanced hypergraphs
✍
András Frank
📂
Article
📅
1977
🏛
Elsevier Science
🌐
English
⚖ 986 KB
Let P be nn arborcscencc, and let F, = {U,, , I/, ). F, = { \y,, . . , V, } bc two systems consisting of directed s&paths of P. MIntmax theorems and algorithms UC proved concerning the so called bi-pcrth system (P; F,,. F, ). One can define a hypqraph to every hi-path system. The class of t hcsc "Ri