It is the aim of this book to provide a coherent and up-to-date account of the basic methods and results of the combinatorial study of finite set systems.
This book presents what seems to be the most significant work on hypergraphs.
Written by two of the leading researchers in the subject, this book is aimed at mathematically mature undergraduates, and highlights the elegance and power of this field of study.
Intended for graduate students, instructors teaching extremal combinatorics and researchers, this book serves as a sound introduction to the theory of extremal set systems.
This book contains survey articles on topics such as difference sets, polynomials, and pseudorandomness.
Colloquia Mathematica Societatis Jânos Bolyai, 37: Finite and Infinite Sets, Vol. I focuses on the principles, operations, and approaches involved in finite and infinite sets.
The gems of the theory are emphasized: beautiful results with elegant proofs. The book developed from a course at Louisiana State University and combines a careful presentation with the informal style of those lectures.
-H.H. Crapo.-R.P. Dilworth.-J. Edmonds.-P.Erdös.-L.R. Ford, Jr.-D.R. Fulkerson.-D. Gale.-L. Geissinger.-I.J. Good.-R.L. Graham.-A.W. Hales.-P. Hall.-P.R. Halmos.-R.I. Jewett.-I. Kaplansky.-P.W. Kasteleyn.-G. Katona.-D.J. Kleitman.-K. Leeb.
This is a collection of thirty-five articles, covering topics such as finite projective spaces, generalized polygons, strongly regular graphs, diagram geometries, and polar spaces.
This book begins with an elementary combinatorial approach to finite geometries based on finite sets of points and lines, and moves into the classical work on affine and projective planes.
Notwithstanding its title, the reader will not find in this book a systematic account of this huge subject.