Classic papers in combinatorics / edited by Ira Gessel, Gian-Carlo Rota
Type de document : Livre numériqueCollection : Modern Birkhäuser classicsLangue : anglais.Éditeur : Boston : Birkhäuser, cop. 1989ISBN: 9780817648428.ISSN: 2197-1803.Sujet MSC : 01A75, History of mathematics and mathematicians, Collected or selected works; reprintings or translations of classics05-03, History of combinatorics
05-06, Proceedings, conferences, collections, etc. pertaining to combinatorics
01A65, Development of contemporary mathematicsEn-ligne : Springerlink | MSN
Contents:
F. P. Ramsey, On a problem of formal logic, pp. 2–24.
Hassler Whitney, Nonseparable and planar graphs, pp. 25–48.
P. Erdős and G. Szekeres, A combinatorial problem in geometry, pp. 49–56.
P. Hall, On representatives of subsets”, pp. 58–62.
Hassler Whitney, "On the abstract properties of linear dependence”, pp. 63–87.
R. L. Brooks, C. A. B. Smith, A. H. Stone and W. T. Tutte, "The dissection of rectangles into squares”, pp. 88–116.
R. L. Brooks, "On colouring the nodes of a network”, pp. 118–121.
Irving Kaplansky, "Solution of the "problème des ménages”, pp. 122–123.
W. T. Tutte, "A ring in graph theory”, pp. 124–138.
R. P. Dilworth, "A decomposition theorem for partially ordered sets”, pp. 139–144.
Paul R. Halmos and Herbert E. Vaughan, "The marriage problem”, pp. 146–147.
T. van Aardenne-Ehrenfest and N. G. de Bruijn, "Circuits and trees in oriented linear graphs”, pp. 149–163.
W. T. Tutte, "The factors of graphs”, pp. 164–178.
P. Erdős and R. Rado, "A partition calculus in set theory”, pp. 179–241.
L. R. Ford, Jr. and D. R. Fulkerson, "Maximal flow through a network”, pp. 243–248.
G. Pólya, "On picture-writing”, pp. 249–257.
David Gale, "A theorem on flows in networks”, pp. 259–268.
H. J. Ryser, Combinatorial properties of matrices of zeros and ones”, pp. 269–275.
P. Erdős, Graph theory and probability, pp. 276–280.
P. W. Kasteleyn, "The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice, pp. 281–297.
C. Schensted, Longest increasing and decreasing subsequences”, pp. 299–311.
M.-P. Schützenberger, "On a theorem of R. Jungen”, pp. 313–318.
A. W. Hales and R. I. Jewett, "Regularity and positional games”, pp. 319–327.
C. St. J. A. Nash-Williams, "On well-quasi-ordering finite trees”, pp. 329–331.
Gian-Carlo Rota, "On the foundations of combinatorial theory. I. Theory of Möbius functions”, pp. 332–360.
Jack Edmonds, Paths, trees, and flowers”, pp. 361–379.
G. Katona, "A theorem of finite sets”, pp. 381–401.
D. Lubell, "A short proof of Sperner's lemma”, p. 402.
Henry H. Crapo, "Möbius inversion in lattices”, pp. 403–415.
G. F. Clements and B. Lindström, "A generalization of a combinatorial theorem of Macaulay”, pp. 416–424.
I. J. Good, "Short proof of a conjecture by Dyson”, p. 425.
Daniel J. Kleitman, On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors”, pp. 427–429.
R. L. Graham, K. Leeb and B. L. Rothschild, "Ramsey's theorem for a class of categories”, pp. 431–445.
L. Lovász, "A characterization of perfect graphs”, pp. 447–450.
L. Lovász, "A note on the line reconstruction problem”, pp. 451–452.
Richard P. Stanley, "Acyclic orientations of graphs”, pp. 453–460.
Ladnor Geissinger, "Valuations on distributive lattices. I”, pp. 461–471.
Ladnor Geissinger, "Valuations on distributive lattices. II ”, pp. 473–481.
Ladnor Geissinger, "Valuations on distributive lattices. III”, pp. 483–489.
There are no comments on this title.