|
![]() |
|||
|
||||
OverviewThis is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of exercises, ranging in difficulty from ""routine"" to ""worthy of independent publication"", is included. In each section, there are also exercises that contain material not explicitly discussed in the text before, so as to provide instructors with extra choices if they want to shift the emphasis of their course. It goes without saying that the text covers the classic areas, i.e. combinatorial choice problems and graph theory. What is unusual, for an undergraduate textbook, is that the author has included a number of more elaborate concepts, such as Ramsey theory, the probabilistic method and - probably the first of its kind - pattern avoidance. While the reader can only skim the surface of these areas, the author believes that they are interesting enough to catch the attention of some students. Full Product DetailsAuthor: Miklos Bona (Univ Of Florida, Usa)Publisher: World Scientific Publishing Co Pte Ltd Imprint: World Scientific Publishing Co Pte Ltd Dimensions: Width: 15.40cm , Height: 2.00cm , Length: 23.00cm Weight: 0.603kg ISBN: 9789810249014ISBN 10: 9810249012 Pages: 424 Publication Date: 05 June 2002 Audience: College/higher education , Professional and scholarly , Tertiary & Higher Education , Professional & Vocational Replaced By: 9789812568861 Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsEnumerative Combinatorics: The Pigeon-Hole Principle; The Principle of Mathematical induction; Basic Enumeration (Permutations and Lists of Sets and Multisets); Enumeration of Subsets, and the Binomial Theorem; Partitions, Ferrers Shapes, and Stirling Numbers; Generating Functions; Permutations and Their Subsequences; Graph Theory: The Notion of Graphs. Eulerian Circles; Trees and Forests; Planar Graphs; Coloring Problems; Graphs and Matrices; Matching Theory and Matroids; Horizons: Ramsey Theory; The Probabilistic Method; Partially Ordered Sets; Lattices.Reviews.,. a very inviting style of exposition, in which developments are always well motivated and illustrated by numerous examples ... .,."" a very inviting style of exposition, in which developments are always well motivated and illustrated by numerous examples ..."" Author InformationTab Content 6Author Website:Countries AvailableAll regions |