Listing 1 - 10 of 25 | << page >> |
Sort by
|
Choose an application
Graph Theory
Graph theory --- Combinatorial analysis --- Théorie des graphes --- Congresses --- Congrès --- ELSEVIER-B EPUB-LIV-FT --- Graphes. (Congrès) --- Grafen (Congres) --- Graph theory - Congresses
Choose an application
Advances in graph theory
Discrete mathematics --- Graph theory. --- Combinatorial analysis. --- Graph theory --- Addresses, essays, lectures. --- 519.17 --- 681.3*G22 --- Combinatorics --- Algebra --- Mathematical analysis --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- 519.17 Graph theory. Trees --- Graph theory. Trees --- Graph theory - Addresses, essays, lectures
Choose an application
TOC:http://www.loc.gov/catdir/toc/cam027/00068952.html
Discrete mathematics --- Random graphs --- Graphes aléatoires --- Graphes aléatoires --- 519.1 --- 519.1 Combinatorics. Graph theory --- Combinatorics. Graph theory
Choose an application
Choose an application
From the reviews: "Béla Bollobás introductory course on graph theory deserves to be considered as a watershed in the development of this theory as a serious academic subject. ... The book has chapters on electrical networks, flows, connectivity and matchings, extremal problems, colouring, Ramsey theory, random graphs, and graphs and groups. Each chapter starts at a measured and gentle pace. Classical results are proved and new insight is provided, with the examples at the end of each chapter fully supplementing the text... Even so this allows an introduction not only to some of the deeper results but, more vitally, provides outlines of, and firm insights into, their proofs. Thus in an elementary text book, we gain an overall understanding of well-known standard results, and yet at the same time constant hints of, and guidelines into, the higher levels of the subject. It is this aspect of the book which should guarantee it a permanent place in the literature."
Discrete mathematics --- Graph theory. --- Théorie des graphes --- Graph theory --- 519.1 --- #TWER:BOEK --- 681.3*G22 --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Combinatorics. Graph theory --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Extremal problems --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- 519.1 Combinatorics. Graph theory --- Théorie des graphes --- Graphes, Théorie des
Choose an application
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader.
Graph theory. --- 519.1 --- 519.1 Combinatorics. Graph theory --- Combinatorics. Graph theory --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems --- Combinatorics. --- Mathematics of Computing. --- Discrete mathematics --- Théorie des graphes --- Computer science—Mathematics. --- Algorithms. --- Algorithm Analysis and Problem Complexity. --- Algorism --- Algebra --- Arithmetic --- Combinatorics --- Mathematical analysis --- Foundations --- Graphes, Théorie des
Choose an application
Can a Christian escape from a lion? How quickly can a rumor spread? Can you fool an airline into accepting oversize baggage? Recreational mathematics is full of frivolous questions where the mathematician's art can be brought to bear. But play often has a purpose. In mathematics, it can sharpen skills, provide amusement, or simply surprise, and books of problems have been the stock-in-trade of mathematicians for centuries. This collection is designed to be sipped from, rather than consumed in one sitting. The questions range in difficulty: the most challenging offer a glimpse of deep results that engage mathematicians today; even the easiest prompt readers to think about mathematics. All come with solutions, many with hints, and most with illustrations. Whether you are an expert, or a beginner or an amateur mathematician, this book will delight for a lifetime.
Choose an application
Choose an application
Choose an application
Listing 1 - 10 of 25 | << page >> |
Sort by
|