Sparsity and dimension

DOI10.1137/1.9781611974331.ch125zbMath1410.05111OpenAlexW4251162746MaRDI QIDQ4575709

Piotr Micek, Gwenaël Joret, Veit Wiechert

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch125

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)

Related Items (5)

Minors and dimension ⋮ On the dimension of posets with cover graphs of treewidth 2 ⋮ Boolean dimension and local dimension ⋮ Planar Posets Have Dimension at Most Linear in Their Height ⋮ Dimension of posets with planar cover graphs excluding two long incomparable chains

This page was built for publication: Sparsity and dimension