An obvious proof of Fishburn's interval order theorem
From MaRDI portal
Cites work
Cited in
(21)- Proper and unit bitolerance orders and graphs
- A simple proof characterizing interval orders with interval lengths between 1 and \(k\)
- What is reconstruction for ordered sets?
- Some remarks on a problem of J. D. Monk
- Interval orders based on weak orders
- A recognition algorithm for orders of interval dimension two
- Interval orders based on arbitrary ordered sets
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- Interval orders, semiorders and ordered groups
- Generation and enumeration of some classes of interval orders
- Existence of approximate social welfare
- $n!$ matchings, $n!$ posets
- Well, better and in-between
- On mathematical modelling of time-related musical structures
- Decomposing labeled interval orders as pairs of permutations
- On a conjecture about enumerating \((2+2)\)-free posets
- Counting general and self-dual interval orders
- Khovanskii bases of subalgebras arising from finite distributive lattices
- The length polyhedron of an interval order
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
This page was built for publication: An obvious proof of Fishburn's interval order theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685567)
