Combinatorics and Graph Theory (Relié)

Michael-J Mossinghoff, John-M Harris, Jeffry-L Hirst

Note moyenne : | 0 avis
Ce produit n'a pas encore été évalué. Soyez le premier !
  • Springer

  • Paru le : 04/08/2000
  • 1 million de livres à découvrir
  • Livraison à domicile à partir de 0,01 €
  • Paiement sécurisé, débit à l'expédition
43,80 €
Neuf - Expédié sous 2 à 4 semaines
Livré chez vous entre le 13 mars et le 27 mars
Votre note
This book evolved from several courses in combinatories and graph theory given et Appalachian State University and UCLA. Chapter 1 focuses on finite graph theory, including trees, planarity, coloring, matching, and Ramsey theory. Chapter 2 studies combinatories, including the principle of inclusion and exclusion, generating functions, recurrence relations, Polya 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 und 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 fort 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.
    • Introductory concepts
    • Trees
    • Planarity
    • Colorings
    • Matchings
    • Ramsey Theory
    • Three basic problems
    • Binomial coefficients
    • The principle of inclusion and exclusion
    • Generating functions
    • Polya's theory of counting
    • More numbers
    • Pigeons and trees
    • Ramsey revisited
  • ZFC
    • The return of König
    • Ordinals, cardinals and many pigeons
    • Incompleteness and cardinals
    • Weakly compact cardinals
    • Finite combinatorics with infinite consequences
    • Points of departure
    • References.
  • Date de parution : 04/08/2000
  • Editeur : Springer
  • Collection : undergraduate texts in maths
  • ISBN : 0-387-98736-3
  • EAN : 9780387987361
  • Présentation : Relié
  • Nb. de pages : 230 pages
  • Poids : 0.51 Kg
  • Dimensions : 16,0 cm × 24,0 cm × 1,6 cm
John-M Harris did his undergraduate work et Furman University, and he received his Ph.D. from Emory University. He has thought at Appalachian State University and at Furman. His primary mathematical interest is finite graph theory, focusing mainly on subgraphs, paths, und cycles. Jeffry-L Hirst is a mathematical logician and has published a number of papers analyzing the logical strength of theorems of infinite graph theory end combinatories. He received his BA and MA from the University of Kansas, and his Ph.D. from the Pennsylvania State University. He bas thought at the Ohio State University and Appalachian State University. Michael-J Mossinghoff received his undergraduate degree from Texas A & M University, his MS in computer science from Stanford University, and his Ph.D. in mathematics from the University of Texas at Austin. He has thought at Appalachian State University end UCLA. His research concerns analytic and algorithmic problems in number theory and combinatories.

Nos avis clients sur

Avis Trustpilot
Michael-J Mossinghoff et John-M Harris - .
Combinatorics and Graph Theory
43,80 €
Haut de page
Decitre utilise des cookies pour vous offrir le meilleur service possible. En continuant votre navigation, vous en acceptez l'utilisation. En savoir plus OK

Ne partez pas tout de suite...

Inscription newsletter