TY - BOOK ID - 1209636 TI - Hypergraphs : combinatorics of finite sets PY - 1989 VL - 45 SN - 0444874895 9780444874894 9780080558011 0080558011 1281716456 9786611716455 PB - Amsterdam : North Holland, DB - UniCat KW - Discrete mathematics KW - Hypergraphs. KW - Graph theory. KW - Hypergraphs KW - 517.98 KW - 681.3*G22 KW - 517.98 Functional analysis and operator theory KW - Functional analysis and operator theory KW - Graph theory KW - 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} KW - Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} KW - Graphs, Theory of KW - Theory of graphs KW - Combinatorial analysis KW - Topology KW - Extremal problems UR - https://www.unicat.be/uniCat?func=search&query=sysid:1209636 AB - Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint took shape around 1960. In regarding each set as a ``generalised edge'' and in calling the family itself a ``hypergraph'', the initial idea was to try to extend certain classical results of Graph Theory such as the theorems o ER -