Discrete Mathematics

Graph algorithms are easy to visualize and indeed there already exists a variety of packages to animate the dynamics when solving problems from graph theory. Still it can be difficult to understand the ideas behind the algorithm from the dynamic display...

These notes are devoted to the study of some classical problems in the Geometry of Banach spaces. The novelty lies in the fact that their solution relies heavily on techniques coming from Descriptive Set Theory. Thecentralthemeisuniversalityproblems...

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering...

This volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023. The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9781632400338Author Gregory RagoFormat HardbackPage Count 208Imprint Clanrye InternationalPublisher Clanrye InternationalWeight(grams) 449gDimensions(mm)...

Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students...

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of...

Coding theory is concerned with successfully transmitting data through a noisy channel and correcting errors in corrupted messages. It is of central importance for many applications in computer science or engineering. This book gives a comprehensive...

This 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the...

Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be...

The Petersen graph occupies an important position in the development of several areas of modern graph theory because it often appears as a counter-example to important conjectures. In this account, the authors examine those areas, using the prominent...

These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics held at Rutgers University. Their aim is to link together algorithmic problems arising in knot theory, statistical physics and...

Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but...

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let...

This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991. As in previous years, the speakers were mathematicians of the highest quality who spanned the subject area, and...

This book presents the salient features of the general theory of infinite electrical networks in a coherent exposition. Using the basic tools of functional analysis and graph theory, the author examines the fundamental developments in the field and...

This book represents a comprehensive overview of the present state of progress in three related areas of combinatorics. It comprises selected papers from a conference held at the University of Montreal. Topics covered in the articles include association...

This book is a continuation of Theory of Matroids (also edited by Neil White), and again consists of a series of related surveys that have been contributed by authorities in the area. The volume begins with three chapters on coordinatisations, followed...

This 1994 text covers finite linear spaces. It contains all the important results that had been published up to the time of publication, and is designed to be used not only as a resource for researchers in this and related areas, but also as a...

This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this...

Combinatorics is an active field of mathematical study and the British Combinatorial Conference, held biennially, aims to survey the most important developments by inviting distinguished mathematicians to lecture at the meeting. The contributions of the...

This volume is dedicated to Paul Erdos, who profoundly influenced mathematics in the twentieth century, with over 1200 papers in number theory, complex analysis, probability theory, geometry, interpretation theory, algebra set theory and combinatorics...

Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two,...

Association schemes are of interest to both mathematicians and statisticians and this book was written with both audiences in mind. For statisticians, it shows how to construct designs for experiments in blocks, how to compare such designs, and how to...

This is a collection of surveys and research papers on topics of interest in combinatorics, given at a conference in Matrahaza, Hungary. Originally published in journal form, it is here reissued as a book due to its special interest. It is dedicated to...

This volume contains survey articles based on the invited lectures given at the Twenty-second British Combinatorial Conference, held in July 2009 at the University of St Andrews. This biennial conference is a well-established international event, with...

This book is an introductory text on the combinatorial theory of finite geometry. It assumes only a basic knowledge of set theory and analysis, but soon leads the student to results at the frontiers of research. It begins with an elementary combinatorial...

Paul Erdoes was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading...

The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the meeting, and provides an up-to-date survey of current research activity in...

The sign-solvability of a linear system implies that the signs of the entries of the solution are determined solely on the basis of the signs of the coefficients of the system. That it might be worthwhile and possible to investigate such linear systems...

This volume comprises the invited lectures given at the 14th British Combinatorial Conference. The lectures survey many topical areas of current research activity in combinatorics and its applications, and also provide a valuable overview of the subject,...

This book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the...

Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their...

Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, presents a study of...

Design theory has grown to be a subject of considerable interest in mathematics, not only in itself, but for its connections to other fields such as geometry, group theory, graph theory and coding theory. This textbook, first published in 1985, is...

This book provides a rapid introduction to topics in graph theory typically covered in a graduate course. The author sets out the main recent results in several areas of current research in graph theory. Topics covered include edge-colourings, symmetries...

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let...

Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but...

This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other...

This volume is a record of the papers presented to the fourth British Combinatorial Conference held in Aberystwyth in July 1973. Contributors from all over the world took part and the result is a very useful and up-to-date account of what is happening in...