Holes in ordered sets
- 1 December 1985
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 1 (1) , 339-350
- https://doi.org/10.1007/bf02582962
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Absolute Retracts and Varieties of Reflexive GraphsCanadian Journal of Mathematics, 1987
- Order varieties generated by ∨-semilattices of finite widthDiscrete Mathematics, 1985
- Every countable lattice is a retract of a direct product of chainsAlgebra universalis, 1984
- The strong selection property and ordered sets of finite lengthAlgebra universalis, 1984
- Representing Ordered Sets by ChainsNorth-Holland Mathematics Studies, 1984
- The smallest graph variety containing all pathsDiscrete Mathematics, 1983
- An application of the Helly property to the partially ordered setsJournal of Combinatorial Theory, Series A, 1983
- The smallest order variety containing all chainsDiscrete Mathematics, 1981
- A structure theory for ordered setsDiscrete Mathematics, 1981
- Fixed-edge theorem for graphs with loopsJournal of Graph Theory, 1979