U.S.R. Murty – författare

Cet ouvrage propose une introduction claire et structurée à la théorie des graphes, conçue comme un manuel de référence pour les étudiants de licence et de master, en mathématiques comme en informatique. Alliant rigueur mathématique et approche intuitive, il offre un traitement systématique du domaine et présente les méthodes de démonstration les plus courantes, illustrées par de nombreux exemples concrets. Au-delà de sa vocation pédagogique, ce livre constitue également une passerelle vers la recherche, fournissant une base solide pour aborder les avancées contemporaines en théorie des graphes.

"In order to become proficient in mathematics, or in any subject," writes Andre Weil, "the student must realize that most topics in­ volve only a small number of basic ideas. " After learning these basic concepts and theorems, the student should "drill in routine exercises, by which the necessary reflexes in handling such concepts may be ac­ quired. . . . There can be no real understanding of the basic concepts of a mathematical theory without an ability to use them intelligently and apply them to specific problems. " Weil''s insightfulobservation becomes especially important at the graduate and research level. It is the viewpoint of this book. Our goal is to acquaint the student with the methods of analytic number theory as rapidly as possible through examples and exercises. Any landmark theorem opens up a method of attacking other problems. Unless the student is able to sift out from the mass of theory the underlying techniques, his or her understanding will only be academic and not that of a participant in research. The prime number theorem has given rise to the rich Tauberian theory and a general method of Dirichlet series with which one can study the asymptotics of sequences. It has also motivated the development of sieve methods. We focus on this theme in the book. We also touch upon the emerging Selberg theory (in Chapter 8) and p-adic analytic number theory (in Chapter 10).

Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics – computer science, combinatorial optimization, and operations research in particular – but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance.The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided tohelp the reader master the techniques and reinforce their grasp of the material.A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters.

Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics – computer science, combinatorial optimization, and operations research in particular – but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance.The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided tohelp the reader master the techniques and reinforce their grasp of the material.A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters.

Beginning with its origins in the pioneering work of W.T. Tutte in 1947, this monograph systematically traces through some of the impressive developments in matching theory. A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems. The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students.