On a class of balanced hypergraphs

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Let P be an arborescence, and let Fu = {U1Uk}, F1 = {V1Vx be two systems consisting of directed subpaths of P. Minimax theorems and algorithms are proved concerning the so called bi-path system (P; FuFx). One can define a hypergraph to every bi-path system. The class of these "bi-path" hypergraphs is closed under forming of dual, sub and partial hypergraph. Every bi-path hypergraph is balanced but not necessarily unimodular.

Original languageEnglish
Pages (from-to)11-20
Number of pages10
JournalDiscrete Mathematics
Volume20
Issue numberC
DOIs
Publication statusPublished - 1977

Fingerprint

Hypergraph
Path
Minimax Theorem
P Systems
Partial
Closed
Class

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On a class of balanced hypergraphs. / Frank, A.

In: Discrete Mathematics, Vol. 20, No. C, 1977, p. 11-20.

Research output: Contribution to journalArticle

Frank, A. / On a class of balanced hypergraphs. In: Discrete Mathematics. 1977 ; Vol. 20, No. C. pp. 11-20.
@article{3cbd6f2c1c0f4d52acfbd9abd3a48f7b,
title = "On a class of balanced hypergraphs",
abstract = "Let P be an arborescence, and let Fu = {U1Uk}, F1 = {V1Vx be two systems consisting of directed subpaths of P. Minimax theorems and algorithms are proved concerning the so called bi-path system (P; FuFx). One can define a hypergraph to every bi-path system. The class of these {"}bi-path{"} hypergraphs is closed under forming of dual, sub and partial hypergraph. Every bi-path hypergraph is balanced but not necessarily unimodular.",
author = "A. Frank",
year = "1977",
doi = "10.1016/0012-365X(77)90038-3",
language = "English",
volume = "20",
pages = "11--20",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - On a class of balanced hypergraphs

AU - Frank, A.

PY - 1977

Y1 - 1977

N2 - Let P be an arborescence, and let Fu = {U1Uk}, F1 = {V1Vx be two systems consisting of directed subpaths of P. Minimax theorems and algorithms are proved concerning the so called bi-path system (P; FuFx). One can define a hypergraph to every bi-path system. The class of these "bi-path" hypergraphs is closed under forming of dual, sub and partial hypergraph. Every bi-path hypergraph is balanced but not necessarily unimodular.

AB - Let P be an arborescence, and let Fu = {U1Uk}, F1 = {V1Vx be two systems consisting of directed subpaths of P. Minimax theorems and algorithms are proved concerning the so called bi-path system (P; FuFx). One can define a hypergraph to every bi-path system. The class of these "bi-path" hypergraphs is closed under forming of dual, sub and partial hypergraph. Every bi-path hypergraph is balanced but not necessarily unimodular.

UR - http://www.scopus.com/inward/record.url?scp=44649118359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44649118359&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(77)90038-3

DO - 10.1016/0012-365X(77)90038-3

M3 - Article

AN - SCOPUS:44649118359

VL - 20

SP - 11

EP - 20

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - C

ER -