The Kelly--Trotter conjecture and dimension of poset products
Zhaochen Dong, Kaiyun Wang
Source abstract
We study the order dimension of Cartesian products of finite posets. Kelly and Trotter conjectured in 1982 that for all finite posets and . For , let denote the incidence poset of the complete graph on vertices. We prove that there is a constant such that, for all sufficiently large , . Since , this disproves the Kelly--Trotter conjecture and shows that can grow linearly with . For every integer , we construct an incidence poset such that and has the -covering property. Consequently, for every poset with . Thus, for every integer , the poset violates the Kelly--Trotter conjecture with every poset of dimension at least . Finally, we prove that a poset has an -covering if and only if for every finite chain with at least two elements.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.