Combinatorics and Graph Theory
- ISBN-10
- 1475748035
- ISBN-13
- 9781475748031
- Series
- Combinatorics and Graph Theory
- Category
- Mathematics
- Pages
- 237
- Language
- English
- Published
- 2013-04-18
- Publisher
- Springer Science & Business Media
- Authors
- Jeffry L. Hirst, John M. Harris, Michael J. Mossinghoff
Description
This book evolved from several courses in combinatorics and graph theory given at Appalachian State University and UCLA. Chapter 1 focuses on finite graph theory, including trees, planarity, coloring, matchings, and Ramsey theory. Chapter 2 studies combinatorics, including the principle of inclusion and exclusion, generating functions, recurrence relations, Pólya theory, the stable marriage problem, and several important classes of numbers. Chapter 3 presents infinite pigeonhole principles, König's lemma, and Ramsey's theorem, and discusses their connections to axiomatic set theory. The text is written in an enthusiastic and lively style. 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 text is primarily directed toward upper-division undergraduate students, but lower-division undergraduates with a penchant for proof and graduate students seeking an introduction to these subjects will also find much of interest.
Get the book
Other editions
Similar books
-
Integral Geometry and Tomography: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Held June 24-30, 1989, with Support from the...
By Eric Grinberg, Eric Todd QuintoIn Section 2 we will deal with the “discrete” case. Let S be a locally finite tree T endowed with the natural integer-valued distance function: the ...
-
Ordinary Differential Equations and Linear Algebra: A Systems Approach
By Todd Kapitula... for in this case [yp](s)=s[yp](s), [yp](s)=s2[yp](s). As we will see in the examples, this assumption also makes it possible to deal with the initial ...
-
Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis
By Iris van Rooij, Mark Blokpoel, Johan Kwisthoutx,y∈S δ(x,y) is maximum. u(x) + ADDITIVE SUBSET CHOICE Input: A set X = {x1 ,x2 ... F Tractability cycle Test 8.2 How (Not) to Deal with Intractability 173.
-
Mymathlab -- Standalone Access Card
By Pearson Education, David P Pearson Education, Hall H Pearson EducationSeveral versions of Pearson's MyLab & Mastering products exist for each title, including customized versions for individual schools, and registrations are not transferable.
-
Mymathlab Student Acc Kit + Intro Alg Wrkshts
By Inc. Pearson EducationMymathlab Student Acc Kit + Intro Alg Wrkshts
-
Pearson Mathematics 7: H.P
By Pearson Education Australia StaffPearson Mathematics homework program for Year 7 provides tear-out sheets which correspond with student book sections, providing systematic and cumulative skills revision of basic skills and current class topics in the form of take-home ...
-
Worksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models
By Addison-WesleyWorksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models
-
Pearson Mathematics New South Wales 8 Student Book: Australian Curriculum
By Pearson Education Australia Staff, Gael McLeod, David CoffeyThe Student Book provides an easy-to-use 'nuts and bolts' book at each year level.
-
Matrix Iterative Analysis
By Richard S. Varga... partial differential equations have received a great deal of attention. For excellent bibliographical coverage, see Todd (1956), Richtmyer (1957), ...
-
Mathematical Modelling: Education, Engineering and Economics - ICTMA 12
By C Haines, P Galbraith, W BlumTodd, P. A., McKeen, .l. ... ANALYTICAL SUPPORT PROBLEM SOLVING Cognitive Perspectives on Modelling HOW DO STUDENTS AND TEACHERS DEAL Sodhi and Son 219 NOTE ...