Piotr Micek

collaborators

4 papers

math.CO2026

The grid-minor theorem revisited

Vida DujmoviÄ, Robert Hickingbotham, JÄdrzej Hodor +6

We prove that for every planar graph $X$ of treedepth $h$ , there exists a positive integer $c$ such that for every $X$ -minor-free graph $G$ , there exists a graph $H$ of treewidth a…

cs.DM2025

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets

Marthe Bonamy, Oscar Defrain, Piotr Micek +1

Enumerating minimal transversals in a hypergraph is a notoriously hard problem. It can be reduced to enumerating minimal dominating sets in a graph, in fact even to enumerating min…

math.CO2025

Cliquewidth and dimension

GwenaÃ«l Joret, Piotr Micek, MichaÅ Pilipczuk +1

We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains the standard example of dimension $k$ as a subposet. This applies in particular to…

math.CO2025

Boolean dimension of a Boolean lattice

Marcin BriaÅski, JÄdrzej Hodor, Hoang La +2

For every integer $n$ with $n \geq 6$ , we prove that the Boolean dimension of a poset consisting of all the subsets of ${1, \dots, n}$ equipped with the inclusion relation is stric…