Combinatorics and graph theory

Unifies discrete and computational geometry by using forbidden patterns of points to characterize many of its problems.

This book includes nine articles representing a timely snapshot of the state of the art in the different areas of combinatorics.

The first of two volumes covering the Steenrod algebra and its various applications.

The second of two volumes covering the Steenrod algebra and its various applications.

This book includes nine articles representing a timely snapshot of the state of the art in the different areas of combinatorics.

An introduction to enumerative combinatorics, vital to many areas of mathematics.

An introduction to enumerative combinatorics, vital to many areas of mathematics.

Do quantum field theory without Feynman diagrams!

Do quantum field theory without Feynman diagrams!

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.

This second volume of two presents analytic equivalents to the Riemann hypothesis.

Useful but hard-to-find results enrich this introduction to the analytic study of random walks on infinite graphs.

Useful but hard-to-find results enrich this introduction to the analytic study of random walks on infinite graphs.

This expanded edition of the classic work on empirical processes now boasts several new proved theorems not in the first.

This expanded edition of the classic work on empirical processes now boasts several new proved theorems not in the first.

The second edition of a successful and unique textbook for students in mathematics or theoretical computer science.

The second edition of a successful and unique textbook for students in mathematics or theoretical computer science.

A textbook in combinatorics for second-year undergraduate to beginning graduate students.

Applications of combinatorics in bioformatics, text processing, combinatorial enumeration and fractal analysis.

Uses the combinatorics and representation theory to construct and study important families of Lie algebras and Weyl groups.

Uses the combinatorics and representation theory to construct and study important families of Lie algebras and Weyl groups.

A textbook in combinatorics for second-year undergraduate to beginning graduate students.

This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991.

This book provides a valuable survey of the present status of knowledge in combinatorics for mathematicians, computer scientists and engineers.

Surveys of recent important developments in combinatorics covering a wide range of areas in the field.

Surveys of recent important developments in combinatorics covering a wide range of areas in the field.

This is an outstanding scholarly attempt to bring together all significant mathematical constants in one place.

This definitive reference on Combinatorica contains examples of all 450 functions plus tutorial text.

This definitive reference on Combinatorica contains examples of all 450 functions plus tutorial text.

A beginning graduate level treatment of elliptic functions with a huge array of examples, first published in 2006.

No other book covers such a wide scope of this aspect of graph theory.

Aimed at graduate students and researchers in enumerative combinatorics, this book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective.

No other book covers such a wide scope of this aspect of graph theory.

This friendly introduction helps undergraduate students understand and appreciate matroid theory and its connections to geometry.

Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.

There is no other book with such a wide scope of both areas of algebraic graph theory.

Survey articles based on the invited lectures given at the Twenty-second British Combinatorial Conference.

This volume, first published in 1999, is a valuable resource on combinatorics for graduate students and researchers.

Contains Grothendieck''s previously unpublished manuscript ''Esquisse d''un Programme'' and related papers.

Provides a unified understanding of the use of generating functions for labelled and unlabelled structures.

Describes combinatorics involving Young tableaux and their uses in representation theory and algebraic geometry.

Authoritative collection of surveys and papers that will be indispensable to all research workers in the area.

These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics, Rutgers University.

This book represents a comprehensive overview of the present state of progress in three related areas of combinatorics.

This book is a continuation of Theory of Matroids and again consists of a series of related surveys.

This volume contains the invited talks from the 18th British Combinatorial Conference, held in 2001.

There is no other book with such a wide scope of both areas of algebraic graph theory.

Percolation theory describes the effects of the connectivity of microscopic or small-scale elements of a complex medium to its macroscopic or large-scale properties.

Offers an exact, non-asymptotic approach to studying large-scale features of finite networks that arise in real applications.