These are notes deriving from lecture courses given by the authors in 1973 at Westfield College, London. The lectures described the connection between the theory of t-designs on the one hand, and graph theory on the other. A feature of this book is the discussion of then-recent construction of t-designs from codes. Topics from a wide range of finite combinatorics are covered and the book will interest all scholars of combinatorial theory.
Combinatorial designs represent an important area of contemporary discrete mathematics closely related to such fields as finite geometries, regular graphs and multigraphs, factorisations of graphs, linear algebra, number theory, finite fields, group and quasigroup theory, Latin squares, and matroids. It has a history of more than 150 years when it started as a collection of unrelated problems. Nowadays the field is a well-developed theory with deep mathematical results and a wide range of applications in coding theory, cryptography, computer science, and other areas. In the most general setting, a combinatorial design consists of a ground set of elements and a collection of subsets of these elements satisfying some specific restrictions; the latter are often expressed in the language of graphs. On the other side, hypergraph theory is a relatively new field which started in early 60s of the last century as a generalization of graph theory. A hypergraph consists of a ground set of elements and a collection of subsets of these elements without any specific restrictions. In this sense the concept of hypergraph is more general than the concept of combinatorial design. While it started as a generalization of graph theory, hypergraph theory soon became a separate subject because many new properties have been discovered that miss or degenerate in graphs. Compared to graph theory, the language of hypergraphs not only allows us to formulate and solve more general problems, it also helps us to understand and solve several graph theory problems by simplifying and unifying many previously unrelated concepts. The 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. Its primary audience is researchers and graduate students taking courses in design theory, combinatorial geometry, finite geometry, discrete mathematics, graph theory, combinatorics, cryptography, information and coding theory, and similar areas. The aim of this book is to show the connection and mutual benefit between hypergraph theory and design theory. It does not intend to give a survey of all important results or methods in any of these subjects.
Because of its inherent simplicity, graph theory has a wide range of applications in engineering, and in physical sciences. It has of course uses in social sciences, in linguistics and in numerous other areas. In fact, a graph can be used to represent almost any physical situation involving discrete objects and the relationship among them. Now with the solutions to engineering and other problems becoming so complex leading to larger graphs, it is virtually difficult to analyze without the use of computers. This book is recommended in IIT Kharagpur, West Bengal for B.Tech Computer Science, NIT Arunachal Pradesh, NIT Nagaland, NIT Agartala, NIT Silchar, Gauhati University, Dibrugarh University, North Eastern Regional Institute of Management, Assam Engineering College, West Bengal Univerity of Technology (WBUT) for B.Tech, M.Tech Computer Science, University of Burdwan, West Bengal for B.Tech. Computer Science, Jadavpur University, West Bengal for M.Sc. Computer Science, Kalyani College of Engineering, West Bengal for B.Tech. Computer Science. Key Features: This book provides a rigorous yet informal treatment of graph theory with an emphasis on computational aspects of graph theory and graph-theoretic algorithms. Numerous applications to actual engineering problems are incorpo-rated with software design and optimization topics.
Provides a self-contained introduction to Lie groups and makes results about the structure of Lie groups and compact groups available to a wide audience.
This book gives a fairly elementary introduction to the local theory of differentiable mappings and is suitable as a text for courses to graduates and advanced undergraduates.
Combinatorics is an active field of mathematical study and the British Combinatorial Conference, held biennially, aims to survey the most important developments by inviting distinguished mathematicians to lecture at the meeting. The contributions of the principal lecturers at the Seventh Conference, held in Cambridge, are published here and the topics reflect the breadth of the subject. Each author has written a broadly conceived survey, not limited to his own work, but intended for wide readership. Important aspects of the subject are emphasized so that non-specialists will find them understandable. Topics covered include graph theory, matroids, combinatorial set theory, projective geometry and combinatorial group theory. All those researching into any aspect of Combinatorics and its applications will find much in these articles of use and interest.
The subject of this book is the action of permutation groups on sets associated with combinatorial structures. Each chapter deals with a particular structure: groups, geometries, designs, graphs and maps respectively. A unifying theme for the first four chapters is the construction of finite simple groups. In the fifth chapter, a theory of maps on orientable surfaces is developed within a combinatorial framework. This simplifies and extends the existing literature in the field. The book is designed both as a course text and as a reference book for advanced undergraduate and graduate students. A feature is the set of carefully constructed projects, intended to give the reader a deeper understanding of the subject.
This exposition of research on the martingale and analytic inequalities associated with Hardy spaces and functions of bounded mean oscillation (BMO) introduces the subject by concentrating on the connection between the probabilistic and analytic approaches. Short surveys of classical results on the maximal, square and Littlewood-Paley functions and the theory of Brownian motion introduce a detailed discussion of the Burkholder-Gundy-Silverstein characterization of HP in terms of maximal functions. The book examines the basis of the abstract martingale definitions of HP and BMO, makes generally available for the first time work of Gundy et al. on characterizations of BMO, and includes a probabilistic proof of the Fefferman-Stein Theorem on the duality of H11 and BMO.