An obvious proof of Fishburn's interval order theorem
From MaRDI portal
Publication:685567
DOI10.1016/0012-365X(93)90065-2zbMATH Open0781.06001OpenAlexW2077624763MaRDI QIDQ685567FDOQ685567
Authors: Kenneth P. Bogart 
Publication date: 17 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90065-2
Cites Work
Cited In (19)
- Generation and enumeration of some classes of interval orders
- A simple proof characterizing interval orders with interval lengths between 1 and \(k\)
- Interval orders, semiorders and ordered groups
- What is reconstruction for ordered sets?
- Well, better and in-between
- Decomposing labeled interval orders as pairs of permutations
- On a conjecture about enumerating \((2+2)\)-free posets
- 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
- Proper and unit bitolerance orders and graphs
- Existence of approximate social welfare
- Interval orders based on arbitrary ordered sets
- A recognition algorithm for orders of interval dimension two
- Some remarks on a problem of J. D. Monk
- $n!$ matchings, $n!$ posets
- Counting general and self-dual interval orders
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- On mathematical modelling of time-related musical structures
- Interval orders based on weak orders
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)
