Skip to content

Combinatorial Theory (Classics in Mathematics)
Stock Photo: Cover May Be Different

Combinatorial Theory (Classics in Mathematics) Paperback - 1996

by Aigner, Martin

  • Used

Description

UsedVeryGood. slightly faded spine
UsedVeryGood
NZ$37.65
NZ$6.63 Shipping to USA
Standard delivery: 3 to 12 days
More Shipping Options
Ships from Books4Cause Inc. (Illinois, United States)

Details

  • Title Combinatorial Theory (Classics in Mathematics)
  • Author Aigner, Martin
  • Binding Paperback
  • Edition Reprint
  • Condition UsedVeryGood
  • Pages 483
  • Volumes 1
  • Language ENG
  • Publisher Springer, Berlin, Heidelberg, New York
  • Date 1996-12-16
  • Illustrated Yes
  • Features Bibliography, Illustrated
  • Bookseller's Inventory # 5D400000A3B9_ns
  • ISBN 9783540617877 / 3540617876
  • Weight 1.45 lbs (0.66 kg)
  • Dimensions 9.3 x 6.22 x 1.04 in (23.62 x 15.80 x 2.64 cm)
  • Library of Congress Catalog Number 96051833
  • Dewey Decimal Code 511.6

About Books4Cause Inc. Illinois, United States

Biblio member since 2020
Seller rating: This seller has earned a 5 of 5 Stars rating from Biblio customers.

We aim to please with better quality books than described and fast shipping. Please reach out if there are any issues.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Books4Cause Inc.

First line

An undirected graph G(V,E) consists of a non-empty set V, called the vertex-set and a multiset E of unordered pairs (a, b) from V, called the edge-set.

From the rear cover

Reihentext + Combinatorial Theory From the reviews: "This book presents a very good introduction to combinatorics. It covers most aspects of enumeration and order theory, ... It is divided into three parts. The first part presents the basic material on mappings and posets... The second part deals with enumeration ... Finally the third part treats of the order-theoretic aspects ... In the text examples are given and at the end of each chapter valuable notes, also very good selected exercises. They constitute an organic part of the book. This book can warmly be recommended first of all to students interested in combinatorics. A two semester course can also be based on it." (Publicationes Mathematicae Debrecen)

Categories

About the author

Biography of Martin Aigner

Martin Aigner received his Ph.D. in Mathematics in 1965 from the University of Vienna. He then spent five years in the United States, the last two at the University of North Carolina at Chapel Hill where he was introduced to the combinatorial world (which he has never left since) by G. C. Rota and the late R. C. Bose. After extensive travels he returned to Europe and spent three years at the University of Tbingen with a senior fellowship of the German Science Foundation. Since 1974 he has been a Professor of Mathematics at the Free University of Berlin.
Martin Aigner has published in various fields of combinatorics and graph theory and is the author of several monographs on discrete mathematics, graph theory and the theory of search.