Every Poset has a Large Cut
Combinatorics
2025-07-17 v1 Discrete Mathematics
Abstract
We prove that every finite poset has a directed cut with at least one half of the poset's pairwise order relations. The bound is tight. Also, the largest directed cut in a poset can be found in linear time.
Keywords
Cite
@article{arxiv.2507.12077,
title = {Every Poset has a Large Cut},
author = {Nati Linial and Ori Shoshani},
journal= {arXiv preprint arXiv:2507.12077},
year = {2025}
}
Comments
5 pages