𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Aspects of semiorders within interval orders

✍ Scribed by Peter C. Fishburn

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
791 KB
Volume
40
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let sk(n) be the largest integer such that every n-point interval order with NO antichain of more than k points includes an Sk(n)-point 'semiorder. When k = 1, s,(n) = n since all interval ordexs with no two-point antichains are ch:&s.

πŸ“œ SIMILAR VOLUMES

On the complexity of interval orders and
On the complexity of interval orders and semiorders
✍ U. Faigle; Gy. TurΓ‘n πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 607 KB

The recognition complexity of interval orders is shown to be Q(n log, n), and an optimal algorithm is given for the identification of semiorders. \* Supported by the joint research project "Algorithmic Aspects of Combinatorial Optimization" of the Hungarian Academy of Sciences (Magyar Tudomanyos Aka

Gray Codes for the Ideals of Interval Or
Gray Codes for the Ideals of Interval Orders
✍ Michel Habib; Lhouari Nourine; George Steiner πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 218 KB

The generation of combinatorial objects in a Gray code manner means that the difference between successive objects is small, e.g., one element for subsets or one transposition for permutations of a set. The existence of such Gray codes is often equivalent to an appropriately defined graph on these o

A bound on the dimension of interval ord
A bound on the dimension of interval orders
✍ K.P Bogart; Issie Rabinovich; W.T Trotter Jr. πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 605 KB