3-Interval irreducible partially ordered sets | Zendy

Stefan Felsner | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

3-Interval irreducible partially ordered sets

Author(s) -

Stefan Felsner

Publication year - 1994

Publication title -

order

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.465

H-Index - 27

eISSN - 1572-9273

pISSN - 0167-8094

DOI - 10.1007/bf01108596

Subject(s) - partially ordered set , mathematics , characterization (materials science) , bipartite graph , interval (graph theory) , combinatorics , dimension (graph theory) , discrete mathematics , graph , materials science , nanotechnology

In this paper we discuss the characterization problem for posets of interval dimension at most 2. We compile the minimal list of forbidden posets for interval dimension 2. Members of this list are called 3-interval irreducible posets. The problem is related to a series of characterization problems which have been solved earlier. These are: The characterization of planar lattices, due to Kelly and Rival [5], the characterization of posets of dimension at most 2 (3-irreducible posets) which has been obtained independently by Trotter and Moore [8] and by Kelly [4] and the characterization of bipartite 3-interval irreducible posets due to Trotter [9].

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research