Crowns, Fences, and Dismantlable Lattices

DOI10.4153/CJM-1974-120-2zbMath0271.06003OpenAlexW2312617871MaRDI QIDQ3215248

David Kelly, Ivan Rival

Publication date: 1974

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1974-120-2

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Modular lattices, Desarguesian lattices (06C05)

Related Items (29)

Minimal tiled orders of finite global dimension ⋮ Unnamed Item ⋮ A proof of Frankl's union-closed sets conjecture for dismantlable lattices ⋮ Interval dismantlable lattices ⋮ Factorizing lattices by interval relations ⋮ Interval-dismantling for lattices ⋮ Covering energy of posets and its bounds ⋮ A structure theory for ordered sets ⋮ Discrete posets, cell complexes, and the global dimension of tiled orders ⋮ On the lattice of order ideals of an up-down poset ⋮ Dismantlability, connectedness, and mixing in relational structures ⋮ Parsimonious cluster systems ⋮ Non-matchable distributive lattices ⋮ Perfect zero-divisor graphs ⋮ Posets Dismantlable by Doubly Irreducibles ⋮ On the dimension of partially ordered sets ⋮ Characterization problems for graphs, partially ordered sets, lattices, and families of sets ⋮ A fixed point theorem for finite partially orderes sets ⋮ Path length in the covering graph of a lattice ⋮ Incomparability graphs of dismantable lattices ⋮ Dismantlability, Connectedness, and Mixing in Relational Structures ⋮ Some complexity bounds for subtype inequalities ⋮ Purely chromatic and hyper chromatic lattices ⋮ Obituary: Ivan Rival ⋮ Vertex-to-vertex pursuit in a graph ⋮ Finite sublattices generated by order-isomorphic subsets ⋮ Weak bases in modular lattices ⋮ Drawing orders with few slopes ⋮ Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)

This page was built for publication: Crowns, Fences, and Dismantlable Lattices