Berge, Claude Hypergraphs. Combinatorics of finite sets. Transl. from the French. (English) Zbl 0674.05001 North-Holland Mathematical Library 45. Amsterdam etc.: North-Holland (ISBN 0-444-87489-5). x, 255 p. (1989). The French original of this volume arose as an updated version from Part 2 of the author’s book “Graphes et hypergraphes” [Paris: Dunod (1970; Zbl 0213.25702)] which was also translated into English (Amsterdam 1973). Since the original was reviewed in Zbl 0623.05001 let us recall chapter headings only: (1) General concepts; (2) Transversal sets and matchings; (3) Fractional transversals; (4) Colourings; (5) Hypergraphs generalizing bipartite graphs. - Appendix: Matchings and colourings in matroids. Reviewer: Jiří Sedláček (Praha) Cited in 7 ReviewsCited in 340 Documents MathOverflow Questions: What is a bipartite hypergraph? MSC: 05-02 Research exposition (monographs, survey articles) pertaining to combinatorics 05C65 Hypergraphs 05A05 Permutations, words, matrices 05B35 Combinatorial aspects of matroids and geometric lattices Citations:Zbl 0332.05101; Zbl 0311.05101; Zbl 0254.05101; Zbl 0213.25702; Zbl 0623.05001 PDFBibTeX XMLCite \textit{C. Berge}, Hypergraphs. Combinatorics of finite sets. Transl. from the French. Amsterdam etc.: North-Holland (1989; Zbl 0674.05001)