The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.
This book discusses general topological algebras; space C(T,F) of continuous functions mapping T into F as an algebra only (with pointwise operations); and C(T,F) endowed with compact-open topology as a topological algebra C(T,F,c).
Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject.
Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.
This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance.