Combinatorics & Graph Theory

Famous mathematical constants include the ratio of circular circumference to diameter, = 3.14 , and the natural logarithm base, e = 2.718 . Studen...

Approximate groups have shot to prominence in recent years, driven both by rapid progress in the field itself and by a varied and expanding range o...

Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory a...

Biological systems are extremely complex and have emergent properties that cannot be explained or even predicted by studying their individual parts...

This long-awaited textbook is the most comprehensive introduction to a broad swath of combinatorial and discrete mathematics. The text covers enume...

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. ...

Projective geometry is one of the most fundamental and at the same time most beautiful branches of geometry. It can be considered the common founda...

These proceedings contain the contributions of some of the participants in the intensive research period held at the De Giorgi Research Center in P...

This book is designed to be usable as a textbook for an undergraduate course or for an advanced graduate course in coding theory as well as a refer...

Introduction to Abstract Algebra, Second Edition presents abstract algebra as the main tool underlying discrete mathematics and the digital world. ...

The study of network theory is a highly interdisciplinary field, which has emerged as a major topic of interest in various disciplines ranging from...

For some time, medicine has been an important driver for the development of data processing and visualization techniques. Improved technology offer...

This vital contribution to the mathematical literature on combinatorics, algebra and differential equations develops two fundamental finiteness pro...

This revised and enlarged sixth edition of Proofs from THE BOOK features an entirely new chapter on Van der Waerdens permanent conjecture, as well ...

In general terms, a graph decomposition is a partition of a graph into parts satisfying some special conditions. Methods of Graph Decompositions di...

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of...

Introduction to Radar Analysis, Second Edition is a major revision of the popular textbook. It is written within the context of communication theor...

Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in grap...

Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challengi...

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no...

Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's the...

The Rogers--Ramanujan identities are a pair of infinite seriesinfinite product identities that were first discovered in 1894. Over the past several...