The gold partition conjecture for 6-thin posets (Q943372): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Linear extensions of infinite posets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 1/3–2/3 Conjecture for 5-Thin Posets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New results in minimum-comparison sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The gold partition conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for Subgraph Isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm to generate all topological sorting arrangements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5657656 / rank | |||
Normal rank |
Latest revision as of 16:36, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The gold partition conjecture for 6-thin posets |
scientific article |
Statements
The gold partition conjecture for 6-thin posets (English)
0 references
9 September 2008
0 references
The paper deals with linear extensions of finite posets. The author considers the gold partition conjecture (GPC) that implies the 1/3-2/3 conjecture. In the main theorem of the paper it is proved that the GPC holds for every finite, 6-thin poset. The proof of that result involves the extensive use of computers.
0 references
poset
0 references
linear extension
0 references
1/3-2/3 conjecture
0 references
gold partition conjecture
0 references