Combinatorics and Graph Theory
By: Harris, John [author.].
Contributor(s): Hirst, Jeffry L [author.] | Mossinghoff, Michael [author.] | SpringerLink (Online service).
Material type:
BookSeries: Undergraduate Texts in Mathematics: Publisher: New York, NY : Springer New York, 2008.Description: XV, 381 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387797113.Subject(s): Mathematics | Mathematical logic | Discrete mathematics | Combinatorics | Mathematics | Discrete Mathematics | Combinatorics | Mathematical Logic and FoundationsDDC classification: 511.1 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Available | EBK10304 |
Graph Theory -- Combinatorics -- Infinite Combinatorics and Graphs.
This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The second edition includes many new topics and features: • New sections in graph theory on distance, Eulerian trails, and Hamiltonian paths. • New material on partitions, multinomial coefficients, and the pigeonhole principle. • Expanded coverage of Pólya Theory to include de Bruijn’s method for counting arrangements when a second symmetry group acts on the set of allowed colors. • Topics in combinatorial geometry, including Erdos and Szekeres’ development of Ramsey Theory in a problem about convex polygons determined by sets of points. • Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable. • Numerous new exercises throughout the book. About the First Edition: ". . . this is what a textbook should be! The book is comprehensive without being overwhelming, the proofs are elegant, clear and short, and the examples are well picked." — Ioana Mihaila, MAA Reviews.
There are no comments for this item.