Abstract
This paper studies some properties of hypergraphs in connection with a class of integer linear programming problems. The main result (theorem 3) states that the strong chromatic number of a balanced hypergraph is equal to its rank; this generalizes a result known for unimodular hypergraphs. Two applications of this result are given, the first one to Graph theory (theorem 5), the second one to integral linear programming (theorem 6).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
C. Berge, “The rank of a family of sets and some applications to graph theory,”Recent progress in combinatorics, Ed. W.T. Tutte (Academic Press, 1969) pp. 49–57.
C. Berge:Graphes et hypergraphes (Dunod, Paris, 1970) Ch. 20.
C. Berge and M. Las Vergnas, “Sur un theoreme du type Konig pour hypergraphes,”Int. conf. on combinatorial mathematics, Eds. A. Gerwitz and L. Quintas (Annals of the New York Academy of Science 175, 1970) 32–40.
P. Erdos and A. Hajnal, “On chromatic number of graphs and set systems,”Acta Mathematicae Acad. Sc. Hungarica 17 (1966) 61–99.
D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra,”Mathematical Programming, 1 (1971) 168–194.
P. Gilmore, “Families of sets with faithful graph representation,” Research Note N.C. 184, I.B.M. (1962).
R.P. Gupta, “A decomposition theorem for bipartite graphs,”Théorie des graphes, Rome I.C.C., Ed. P. Rosenstiehl (Dunod, Paris, 1967) pp. 135–138.
L. Lovasz, “Subgraphs with prescribed valencies,”Journal of Combinatorial Theory 8 (1970) 391–416.
A.J. Hoffman, “Some recent application of the theory of linear inequalities to extremal combinatorial analysis,”Proc. Symposium Applied Mathematics 10 (1960) pp. 113–127.
A.J. Hoffman and J.B. Kruskal, “Integral boundary points of convex polyhedra,”Annals of Mathematical Studies 38 (Princeton University Press, 1956) pp. 223–246.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Berge, C. Balanced matrices. Mathematical Programming 2, 19–31 (1972). https://doi.org/10.1007/BF01584535
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584535