Hypergraph Theory

This brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks. First, in Chap. 1, the authors introduce the basic preliminaries of hypergraph theory in general, and develop two hypergraph based polynomial algorithms, i.e., hypergraph coloring and hypergraph clustering.

Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday.

This book explores two of the most striking features of quantum theory – contextuality and nonlocality – using a formulation based on graph theory. Quantum theory provides a set of rules to predict probabilities of different outcomes in different experimental settings, and both contextuality and nonlocality play a fundamental role in interpreting the outcomes. In this work, the authors highlight how the graph approach can lead to a better understanding of this theory and its applications. After presenting basic definitions and explaining the non-contextuality hypothesis, the book describes contextuality scenarios using compatibility hypergraphs. It then introduces the exclusivity graph approach, which relates a number of important graph-theoretical concepts to contextuality. It also presents open problems such as the so-called Exclusivity Principle, as well as a selection of important topics, like sheaf-theoretical approach, hypergraph approach, and alternative proofs of contextuality.