Atlas Mathematical Conference Abstracts || Conferences | Abstracts | for Organizers | About AMCA

Horizons in Combinatorics/16th Shanks Lecture Series
May 21-24, 2001
Vanderbilt University
Nashville, TN, USA

Organizers
Paul Edelman, Mark Ellingham, Jonathan Farley, Mike Plummer, Jerry Spinrad

View Abstracts
Conference Homepage

N-free ordered sets are reconstructible
by
Bernd Schroeder
Louisiana Tech University

An ordered set is called N-free iff it does not contain a set of four elements { a, b, c, d} such that a is a lower cover of b, b is an upper cover of c, c is a lower cover of d and no further comparabilities. We shall prove that these ordered sets are reconstructible from their one-point deleted subsets.

Date received: March 27, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-10.