Improved lower bounds on the on-line chain partitioning of posets of bounded dimension

DOI10.1007/s11083-023-09629-7arXiv2111.04802OpenAlexW4361283673MaRDI QIDQ6139864

Israel R. Curbelo, Csaba Biró

Publication date: 19 December 2023

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

on-line algorithmchain partitioningposet dimension

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites Work

• Unnamed Item
• On-line chain partitions of orders: a survey
• On-line chain partitions of orders
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
• A theory of recursive dimension of ordered sets
• An Effective Version of Dilworth's Theorem

This page was built for publication: Improved lower bounds on the on-line chain partitioning of posets of bounded dimension