Discrete Mathematics, Volume 35

Volume 35, Numbers 1-3, 1981

• Martin Aigner:
  Producing posets. 1-15
  Electronic Edition (link) BibTeX
• Peter Burmeister:
  On maximal objects in classes of (DI)graphs determined by prescribed factorobjects. 17-23
  Electronic Edition (link) BibTeX
• Thomas H. Brylawski:
  Hyperplane reconstruction of the Tutte polynomial of a geometric lattice. 25-38
  Electronic Edition (link) BibTeX
• Dwight Duffus, Maurice Pouzet, Ivan Rival:
  Complete ordered sets with no infinite antichains. 39-52
  Electronic Edition (link) BibTeX
• Dwight Duffus, Ivan Rival:
  A structure theory for ordered sets. 53-118
  Electronic Edition (link) BibTeX
• Marcel Erné:
  On the cardinalities of finite topologies and the number of antichains in partially ordered sets. 119-133
  Electronic Edition (link) BibTeX
• David Kelly:
  On the dimension of partially ordered sets. 135-156
  Electronic Edition (link) BibTeX
• R. Mckenzie, R. Quackenbush:
  The spectrum of a lattice-primal algebra. 157-163
  Electronic Edition (link) BibTeX
• E. C. Milner, N. Sauer:
  Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma. 165-171
  Electronic Edition (link) BibTeX
• Bernard Monjardet:
  Metrics on partially ordered sets - A survey. 173-184
  Electronic Edition (link) BibTeX
• Hans Jürgen Prömel, Bernd Voigt:
  Recent results in partition (Ramsey) theory for finite lattices. 185-198
  Electronic Edition (link) BibTeX
• Richard Rado:
  Theorems on intervals of ordered sets. 199-201
  Electronic Edition (link) BibTeX
• Ivan Rival, Rudolf Wille:
  The smallest order variety containing all chains. 203-212
  Electronic Edition (link) BibTeX
• Bill Sands:
  Counting antichains in finite partially ordered sets. 213-228
  Electronic Edition (link) BibTeX
• William T. Trotter:
  Stacks and splits of partially ordered sets. 229-256
  Electronic Edition (link) BibTeX