Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number...
Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear progra...
Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number...
Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear progra...
Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research.
The volume is recommended to experienced...
Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present vol...
Describes various techniques in combinatorics. This book is suitable for those who intend to start research in graph theory, combinatorics or their applications, and for those researchers who feel that combinatorial techniques might help them with their wo
Describes various techniques in combinatorics. This book is suitable for those who intend to start research in graph theory, combinatorics or their ap...
Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographie, der linearen Programmierung, der Kodierungstheorie und Informatik. Dieses Buch richtet sich an Studenten der Mathematik und Informatik, die ein Gefuhl dafur entwickeln mochten, worumes in derMathematik geht, wobei Mathematik hilfreich sein kann, und mit welcher Art Fragen sich Mathematiker auseinandersetzen.
Die Autoren stellen eine Anzahl ausgewahlter Ergebnisse und Methoden der diskreten Mathematik vor, hauptsachlich aus den Bereichen...
Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographi...
The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3 7,2008.Althoughthiswouldbeareasontolookback, wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is...
The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhel...
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the...
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the unde...
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well.
The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young...
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structu...
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of...
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as...
Paul Erdos was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the far-reaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole...
Paul Erdos was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, ...
