✦ LIBER ✦

On linear extension majority graphs of partial orders

✍ Scribed by Peter C Fishburn

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 279 KB
Volume: 21
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90028-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting linear extension majority cycle

Counting linear extension majority cycles in partially ordered sets on up to 13 elements

✍ K. De Loof; B. De Baets; H. De Meyer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 599 KB

It is well known that the linear extension majority relation of a partially ordered set (P, ≤ P ) can contain cycles when at least 9 elements are present in P. Computer experiments have uncovered all posets with 9 elements containing such cycles and limited frequency estimates for linear extension m

On the family of linear extensions of a

On the family of linear extensions of a partial order

✍ Peter C Fishburn 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 170 KB

The -step competition graphs of doubly p

The -step competition graphs of doubly partial orders

✍ Boram Park; Jung Yeun Lee; Suh-Ryung Kim 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 239 KB

The competition graph of a doubly partial order is an interval graph. The competitioncommon enemy graph, a variant of the competition graph, of a doubly partial order is also an interval graph if it does not contain a 4-cycle as an induced subgraph. It is natural to ask whether or not the same pheno

Effective extensions of partial orders

✍ Dev Kumar Roy 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

Semicontinuous extension of a partial or

Semicontinuous extension of a partial order

✍ Jean-Yves Jaffray 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Linear extensions of random orders

✍ Graham Brightwell 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A popular model of random orders is obtained by taking two disjoint n-element antichains A, and Al, and putting in each relation in A, x A, with probability l/2, all the choices being made independently. We estimate the number of linear extensions of such an ordered set, showing that this number is