The 1/3-2/3 conjecture for $N$-free ordered sets
Imed Zaguia

TL;DR
This paper proves that every finite N-free ordered set that is not totally ordered contains a balanced pair, advancing understanding of the 1/3-2/3 conjecture in ordered set theory.
Contribution
It establishes the existence of a balanced pair in all finite N-free ordered sets that are not totally ordered, confirming a special case of the 1/3-2/3 conjecture.
Findings
Every finite N-free ordered set not totally ordered has a balanced pair.
The result applies to a broad class of ordered sets, supporting the 1/3-2/3 conjecture.
The proof advances the theory of linear extensions in ordered sets.
Abstract
A balanced pair in a finite ordered set is a pair of elements of such that the proportion of linear extensions of that put before is in the real interval . We prove that every finite -free ordered set which is not totally ordered has a balanced pair.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Algebra and Logic · semigroups and automata theory
