Skip to main content
SpringerLink
Log in
Birkhäuser

Classic Papers in Combinatorics

  • Book
  • © 1987

Overview

Editors:
  1. Ira Gessel

    1. Department of Mathematics, Brandeis University, Waltham, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gian-Carlo Rota

    1. Department of Mathematics, Massachusetts Institute of Technology (MIT), Cambridge, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • An affordable softcover edition of a classic text
  • Over five decades of original papers from the luminaries that defined the field of Combinatorics. Including:
  • 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.
  • Includes supplementary material: sn.pub/extras

Part of the book series: Modern Birkhäuser Classics (MBC)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (39 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. On a Problem of Formal Logic

    • F. P. Ramsey
    Pages 1-24

  3. Non-Separable and Planar Graphs*

    • Hassler Whitney
    Pages 25-48

  4. A Combinatorial Problem in Geometry

    • P. Erdös, G. Szckeres
    Pages 49-56

  5. On Representatives of Subsets

    • P. Hall†
    Pages 58-62

  6. On the Abstract Properties of Linear Dependence1

    • Hassler Whitney
    Pages 63-87

  7. The Dissection of Rectangles Into Squares

    • R. L. Brooks, C. A. B. Smith, A. H. Stone, W. T. Tutte
    Pages 88-116

  8. On Colouring the Nodes of a Network

    • R. L. Brooks
    Pages 118-121

  9. Solution of the “Problème Des Ménages”

    • Irving Kaplansky
    Pages 122-123

  10. A Ring in Graph Theory

    • W. T. Tutte
    Pages 124-138

  11. A Decomposition Theorem for Partially Ordered Sets

    • R. P. Dilworth
    Pages 139-144

  12. The Marriage Problem*

    • Paul R. Halmos, Herbert E. Vaughan
    Pages 146-147

  13. Circuits and Trees in Oriented Linear Graphs

    • T. van Aardenne-Ehrenfest, N.G. de Bruijn
    Pages 149-163

  14. The Factors of Graphs

    • W. T. Tutte
    Pages 164-178

  15. A Partition Calculus in Set Theory

    • P. Erdös, R. Rado
    Pages 179-241

  16. Maximal Flow Through a Network

    • L. R. Ford Jr., D. R. Fulkerson
    Pages 243-248

  17. On Picture-Writing*

    • G. Polya
    Pages 249-257

  18. A Theorem on Flows in Networks

    • David Gale
    Pages 259-268

  19. Combinatorial Properties of Matrices of Zeros and Ones

    • H. J. Ryser
    Pages 269-275

  20. Graph Theory and Probability

    • P. Erdös
    Pages 276-280
Back to top

Keywords

About this book

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 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.

Editors and Affiliations

  • Department of Mathematics, Brandeis University, Waltham, USA

    Ira Gessel

  • Department of Mathematics, Massachusetts Institute of Technology (MIT), Cambridge, USA

    Gian-Carlo Rota

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation