Combinatorics and graph theory

Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.

Modern and Interdisciplinary Problems in Network Science: A Translational Research Perspective covers a broad range of concepts and methods, with a strong emphasis on interdisciplinarity.

Modern and Interdisciplinary Problems in Network Science: A Translational Research Perspective covers a broad range of concepts and methods, with a strong emphasis on interdisciplinarity.

The Art of Proving Binomial Identities accomplishes two goals: (1) It provides a unified treatment of the binomial coefficients, and (2) Brings together much of the undergraduate mathematics curriculum via one theme (the binomial coefficients).

The Art of Proving Binomial Identities accomplishes two goals: (1) It provides a unified treatment of the binomial coefficients, and (2) Brings together much of the undergraduate mathematics curriculum via one theme (the binomial coefficients).

Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics.

Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises.

Analytic Combinatorics: A Multidimensional Approach is written in a reader-friendly fashion to better facilitate the understanding of the subject.

Analytic Combinatorics: A Multidimensional Approach is written in a reader-friendly fashion to better facilitate the understanding of the subject.

Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level.

Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level.

The effectiveness of federated learning in high performance information systems and informatics based solutions for addressing current information support requirements is demonstrated in this book.

Graphs & Digraphs, Seventh Edition masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory.

Concise introduction to permutation groups, focusing on invariant cartesian decompositions and applications in algebra and combinatorics.

An up-to-date, panoramic account of the theory of random walks on groups and graphs, outlining connections with various mathematical fields.

Presents current research in various topics, including homogeneous dynamics, Diophantine approximation and combinatorics.

An up-to-date, panoramic account of the theory of random walks on groups and graphs, outlining connections with various mathematical fields.

Presents current research in various topics, including homogeneous dynamics, Diophantine approximation and combinatorics.

This volume presents a unified and coherent account of the many and various parts of general recursion theory.

An in-depth coverage of selected areas of graph theory focusing on symmetry properties of graphs, ideal for beginners and specialists.

An in-depth coverage of selected areas of graph theory focusing on symmetry properties of graphs, ideal for beginners and specialists.

A concise introduction, aimed at young researchers, to recent developments of a geometric and topological nature in random graphs.

A concise introduction, aimed at young researchers, to recent developments of a geometric and topological nature in random graphs.

Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations.

Surveys trends arising from the applications and interactions between combinatorics, symbolic dynamics and theoretical computer science.

Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations.

Surveys trends arising from the applications and interactions between combinatorics, symbolic dynamics and theoretical computer science.

The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.

The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.

This book contains surveys of recent important developments in combinatorics covering a wide range of areas in the field.

This book contains surveys of recent important developments in combinatorics covering a wide range of areas in the field.

This book explores the inequalities for eigenvalues of the six matrices associated with graphs.

This book explores the inequalities for eigenvalues of the six matrices associated with graphs.

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.

More than 250 exercises and solutions on properties and applications of Catalan numbers, at levels ranging from recreational to research.

More than 250 exercises and solutions on properties and applications of Catalan numbers, at levels ranging from recreational to research.

A broad survey written by acknowledged international experts in the field.

A broad survey written by acknowledged international experts in the field.

This 2004 book presents a fascinating collection of problems related to the Cauchy-Schwarz inequality and coaches readers through solutions.

A revision of an important textbook: essential reading for all combinatorialists.

An introduction to recent developments in algebraic combinatorics and an illustration of how research in mathematics actually progresses.

This book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming.

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("e;generators"e;).

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("e;generators"e;).