- Main Menu-

Catalogue Tag Display

MARC 21

Classic Papers in Combinatorics
Tag	Description
020	$a9780817648428
082	$a511.6
099	$aOnline resource: Birkhäuser
245	$aClassic Papers in Combinatorics$h[EBook]$cedited by Ira Gessel, Gian-Carlo Rota.
250	$aReprint of the 1987 Edition
260	$aBoston, MA$bBirkhäuser$c2009
300	$aX, 492 pages, 10 illus.$bonline resource.
336	$atext
338	$aonline resource
440	$aModern Birkhäuser Classics
505	$aOn 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.
520	$aThis 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 by:.-T. van Aardenne-Ehrenfest.-R.L. Brooks.-N.G. de Bruijn.-G.F. Clements.-H.H. Crapo.-R.P. Dilworth.-J. Edmonds.-P.Erdös.-L.R. Ford, Jr.-D.R. Fulkerson.-D. Gale.-L. Geissinger.-I.J. Good.-R.L. Graham.-A.W. Hales.-P. Hall.-P.R. Halmos.-R.I. Jewett.-I. Kaplansky.-P.W. Kasteleyn.-G. Katona.-D.J. Kleitman.-K. Leeb.-B. Lindström.-L. Lovász.-D. Lubell.-C. St. J.A. Nash-Williams.-G. Pólya.-F.P. Ramsey.-G.C. Rota.-B.L. Rothschild.-H.J. Ryser.-C. Schensted.-M.P. Schützenberger.-R.P. Stanley.-G. Szekeres.-W.T. Tutte.-H.E. Vaughan.-H. Whitney.
538	$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700	$aGessel, Ira.$eeditor.
700	$aRota, Gian-Carlo.$d1932-$eeditor.
710	$aSpringerLink (Online service)
830	$aModern Birkhäuser Classics
856	$uhttp://dx.doi.org/10.1007/978-0-8176-4842-8