Hypergraphs: Combinatorics of Finite Sets
- ISBN-10
- 0080880231
- ISBN-13
- 9780080880235
- Category
- Mathematics
- Pages
- 254
- Language
- English
- Published
- 1984-05-01
- Publisher
- Elsevier
- Author
- C. Berge
Description
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 of Turán and König. It was noticed that this generalisation often led to simplification; moreover, one single statement, sometimes remarkably simple, could unify several theorems on graphs. This book presents what seems to be the most significant work on hypergraphs.
Get the book
Similar books
-
Hypergraph Theory: An Introduction
By Alain BrettoThis book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory.
-
Graphs and Hypergraphs
By Claude BergeGraphs and Hypergraphs
-
Transversals in Linear Uniform Hypergraphs
By Michael A. Henning, Anders YeoMichael A. Henning, Anders Yeo. (H) uniform hypergraphs H is a convex set, where s2 denotes the strong transversal number of H. Further we show that there are infinitely many extreme points of the convex set S3, and we determine all ...
-
Fuzzy Graphs and Fuzzy Hypergraphs
By John N. Mordeson, Premchand S. NairIf A C B and A # 8, then we write A C B. Definition 4.6 Let H = (X, 8) be a fuzzy hypergraph, and for 0 < t < h(H), let H* = (X, E) be the t-level hypergraph of H. The sequence of real numbers {r 1, r2, ..., rn), ...
-
Fuzzy Hypergraphs and Related Extensions
By Muhammad Akram, Anam Luqmancompetition hypergraphs, fuzzy k-competition hypergraphs and fuzzy neighborhood hypergraphs, and N-hypergraphs, complex fuzzy hypergraphs, leih-level hypergraphs, and Cf-tempered complex fuzzy hypergraphs. We describe applications of ...
-
Algorithmic Studies of Graphs and Hypergraphs for Complex Networks
By Jianhang GaoA graph is a mathematical abstraction for modeling networks, in which nodes are represented by vertices and pairwise relationships by edges between vertices. A hypergraph is a natural extension of...
-
Hypergraphs and Designs
By Vitaly Ivanovich Voloshin, Mario Gionfriddo, Lorenzo MilazzoThe main feature of this book is applying the hypergraph approach to the theory of combinatorial designs. An alternative title of it could be "Combinatorial designs as hypergraphs". There is no analogue to this book on the market.
-
Context Free Hypergraph Grammars: Node and Hyperedge Rewriting with an Application to Petri Nets
By Renate Klempien-HinrichsLemma 4.22 states that the sets Red(X) can be computed in time 0(2
-
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
By Bevern, René vanIn this section, we show how tree automata can be used to recognize hypergraph properties. In the form of a Myhill-Nerode theorem for hypergraphs, we provide a necessary and sufficient condition for hypergraph properties to be ...
-
A Geometric Theory for Hypergraph Matching
By Peter Keevash, Richard Mycroft[19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] Hiệp H`an, Yury Person, and Mathias Schacht, On perfect matchings in uniform hypergraphs with large minimum vertex ...