Bøger af Laszlo Lovasz

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 theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures and exercises spread throughout the book.Lszl Lovsz is a Senior Researcher in the Theory Group at Microsoft Corporation. He is a recipient of the 1999 Wolf Prize and the Gdel Prize for the top paper in Computer Science. Jzsef Pelikn is Professor of Mathematics in the Department of Algebra and Number Theory at Etvs Lornd University, Hungary. In 2002, he was elected Chairman of the Advisory Board of the International Mathematical Olympiad. Katalin Vesztergombi is Senior Lecturer in the Department of Mathematics at the University of Washington.

Since his death in 1996, many scientific meetings have been dedicated to the memory of Paul Erdös. From July 4 to 11, 1999, the conference "Paul Erdös and his Mathematics" was held in Budapest, with the ambitious goal of showing the whole range of Erdös' work - a difficult task in view of Erdös' versatility and his broad scope of interest in mathematics. According to this goal, the topics of lectures, given by the leading specialists of the subjects, included number theory, combinatorics, analysis, set theory, probability, geometry and areas connecting them, like ergodic theory. The conference has contributed to changing the common view that Erdös worked only in combinatorics and combinatorial number theory. In the present two volumes, the editors have collected, besides some personal reminiscences by Paul's old friends, mainly survey articles on his work, and on areas he initiated or worked in.

Graphs are usually represented as geometric objects drawn in the plane, consisting of nodes and curves connecting them. The main message of this book is that such a representation is not merely a way to visualize the graph, but an important mathematical tool.

Surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. This book discusses basic results on the existence of matchings and on the matching structure of graphs, as well as the impact of matching theory.

Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.

Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics.