73 citations · 427 across the 49 of their papers we have counts for
56 papers
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 as a subposet. This applies in particular to…
Boolean dimension of a Boolean lattice
Marcin Briański, Jędrzej Hodor, Hoang La +2
For every integer with , we prove that the Boolean dimension of a poset consisting of all the subsets of equipped with the inclusion relation is stric…
The grid-minor theorem revisited
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor +6
We prove that for every planar graph of treedepth , there exists a positive integer such that for every -minor-free graph , there exists a graph of treewidth a…
The Excluded Tree Minor Theorem Revisited
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret +3
We prove that for every tree of radius , there is an integer such that every -minor-free graph is contained in for some graph with pathwidth at m…
Tight bound on treedepth in terms of pathwidth and longest path
Meike Hatzel, Gwenaël Joret, Piotr Micek +3
We show that every graph with pathwidth strictly less than that contains no path on vertices as a subgraph has treedepth at most . The bound is best possible up to…
Product structure extension of the Alon--Seymour--Thomas theorem
Marc Distel, Vida Dujmović, David Eppstein +6
Alon, Seymour and Thomas [1990] proved that every -vertex graph excluding as a minor has treewidth less than . Illingworth, Scott and Wood [2022] recently…