This textbook is devoted to Combinatorics and Graph Theory, which are cornerstones of Discrete Mathematics. Every section begins with simple model problems. Following their detailed analysis, the reader is led through the derivation of definitions, concepts and methods for solving typical problems.

Since the 1980s, the theory of groups - in particular simple groups, finite and algebraic - has influenced a number of diverse areas of mathematics. Such areas include topics where groups have been traditionally applied, such as algebraic combinatorics, finite geometries, Galois theory and permutation groups, as well as several more recent developments.

Alan Tucker's newest issue of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving. As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity.

Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities of set partitions from 1500 A.D. to today.

This book written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. The book focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.

The articles collected here are the texts of the invited lectures given at the Eighth British Combinatorial Conference held at University College, Swansea. The contributions reflect the scope and breadth of application of combinatorics, and are up-to-date reviews by mathematicians engaged in current research. This volume will be of use to all those interested in combinatorial ideas, whether they be mathematicians, scientists or engineers concerned with the growing number of applications.

This trusted best-seller emphasizes combinatorial ideas–including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition clarifies the exposition throughout and adds a wealth of new exercises. Appropriate for one- or two-semester, junior- to senior-level combinatorics courses.

With examples of all 450 functions in action plus tutorial text on the mathematics, this book is the definitive guide to Experimenting with Combinatorica, a widely used software package for teaching and research in discrete mathematics. Three interesting classes of exercises are provided--theorem/proof, programming exercises, and experimental explorations--ensuring great flexibility in teaching and learning the material.

This book constitutes the refereed proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.

This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erdös Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental results and appreciate some of the latest developments. An important feature of the articles, very much in the spirit of Erdös, is the abundance of open problems.

This introduction to combinatorics is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Covers basic counting, functions, decision trees, and sieving methods; fundamental concepts in graph theory and a sampler of graph topics; induction and recursion, sorting theory, and rooted plane trees. Numerous exercises (some with solutions), notes, and references. Includes 75 figures. Appendixes.

Wherefore is this conference book on graphs and combinatorics different from other such books?

One way is that it is, frankly, a progress report on recent results in the field, and does not claim to be a definitive work. Another is that all contributions have been refereed. A third way is that it contains both expository review articles and research contributions.