poset;
linear extension;
1/3-2/3;
conjecture;
Gold Partition Conjecture;
D O I:
10.1007/s11083-008-9081-9
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We consider the Gold Partition Conjecture (GPC) that implies the 1/3-2/3 Conjecture. We prove the GPC in the case where every element of the poset is incomparable with at most six others. The proof involves the extensive use of computers.
机构:
Univ Claude Bernard Lyon 1, Inst Camille Jordan, UMR 5208, Bat Jean Braconnier 101,43 Bd 11 Novembre 1918, F-69622 Villeurbanne, FranceUniv Claude Bernard Lyon 1, Inst Camille Jordan, UMR 5208, Bat Jean Braconnier 101,43 Bd 11 Novembre 1918, F-69622 Villeurbanne, France