
Classic Papers in Combinatorics
Birkhauser Boston Inc (Publisher)
Published on 26. November 2008
Book
Paperback/Softback
X, 492 pages
978-0-8176-4841-1 (ISBN)
Description
This volume surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject proved in over five decades of original papers.
More details
Series
Edition
Reprint of the 1987 ed.
Language
English
Place of publication
Boston
United States
Target group
Professional and scholarly
Research
Product notice
Paperback (trade)
Illustrations
X, 492 p. 10 illus.
Dimensions
Height: 237 mm
Width: 155 mm
Thickness: 25 mm
Weight
706 gr
ISBN-13
978-0-8176-4841-1 (9780817648411)
DOI
10.1007/978-0-8176-4842-8
Schweitzer Classification
Other editions
Additional editions
Ira Gessel | Gian-Carlo Rota
Classic Papers in Combinatorics
Book
05/1987
Birkhauser Boston Inc
€85.59
Article exhausted; check different version
Content
On a Problem of Formal Logic.- Non-Separable and Planar Graphs*.- A Combinatorial Problem in Geometry.- On Representatives of Subsets.- On the Abstract Properties of Linear Dependence1.- The Dissection of Rectangles Into Squares.- On Colouring the Nodes of a Network.- Solution of the "Problème Des Ménages".- A Ring in Graph Theory.- A Decomposition Theorem for Partially Ordered Sets.- The Marriage Problem*.- Circuits and Trees in Oriented Linear Graphs.- The Factors of Graphs.- A Partition Calculus in Set Theory.- Maximal Flow Through a Network.- On Picture-Writing*.- A Theorem on Flows in Networks.- Combinatorial Properties of Matrices of Zeros and Ones.- Graph Theory and Probability.- The Statistics of Dimers on a Lattice.- Longest Increasing and Decreasing Subsequences.- On a Theorem of R. Jungen.- Regularity and Positional Games.- On Well-Quasi-Ordering Finite Trees.- On the Foundations of Combinatorial Theory.- Paths, Trees, and Flowers.- A Theorem of Finite Sets.- A Short Proof of Sperner's Lemma.- Möbius Inversion in Lattices.- A Generalization of a Combinatorial Theorem of Macaulay.- Short Proof of a Conjecture by Dyson.- On a Lemma of Littlewood and Offord on the Distributions of Linear Combinations of Vectors*.- Ramsey's Theorem for a Class of Categories.- A Characterization of Perfect Graphs.- A Note on the Line Reconstruction Problem.- Acyclic Orientations of Graphs*.- Valuations on Distributive Lattices I.- Valuations on Distributive Lattices II.- Valuations on Distributive Lattices III.