An extremal problem on crossing vectors.

DOI10.1016/j.jcta.2014.07.009zbMath1323.06003arXiv1205.1824OpenAlexW2128536938MaRDI QIDQ458279

Piotr Micek, Bartosz Walczak, Noah Streib, Michał Lasoń, William T. jun. Trotter

Publication date: 7 October 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.1824

zbMATH Keywords

extremal problemspartially ordered setscrossing vectorsmaximum antichains

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items (1)

Dimension of posets with planar cover graphs excluding two long incomparable chains

Cites Work

• Unnamed Item
• On the lattice of maximum-sized antichains of a finite poset
• First-Fit is linear on posets excluding two long incomparable chains
• On-line dimension for posets excluding two long incomparable chains
• Intransitive indifference with unequal indifference intervals
• Description of some relations on the set of real-line intervals
• A decomposition theorem for partially ordered sets
• First-Fit Algorithm for the On-Line Chain Partitioning Problem
• An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

This page was built for publication: An extremal problem on crossing vectors.