Combinatorics and ordered sets
About this Title
Ivan Rival, Editor
For the mathematician interested in discrete mathematics, from the senior undergraduate to the professional level, this volume provides first-rate surveys of the important combinatorics themes in ordered sets.
These expository lectures, given at a 1985 Joint Summer Research Conference, cover a wide range of topics, which include: the three-machine problem to illustrate the order-theoretic aspects of scheduling theory; the techniques used in settling the “matching conjecture”; the decomposition of ordered sets into few chains; the reorientation of graphs; the varied occurrences of the meet-distribution property; surveys techniques used in settling binary sorting problems; the formulation of a general viewpoint for retraction; the survey of cutsets; and the role played by subdiagrams in ordered sets.
Table of Contents
- Werner Poguntke – Order-theoretic aspects of scheduling [MR 856231]
- Joseph P. S. Kung – Radon transforms in combinatorics and lattice theory [MR 856232]
- Henry A. Kierstead – Recursive ordered sets [MR 856233]
- Oliver Pretzel – Orientations and reorientations of graphs [MR 856234]
- Paul H. Edelman – Abstract convexity and meet-distributive lattices [MR 856235]
- Peter M. Winkler – Correlation and order [MR 856236]
- El Mostapha Jawhari, Maurice Pouzet and Driss Misane – Retracts: graphs and ordered sets from the metric point of view [MR 856237]
- Mohamed H. El-Zahar and Nejib Zaguia – Antichains and cutsets [MR 856238]
- Ivan Rival – Stories about order and the letter N (en) [MR 856239]