activity
20102023
most citedExcluding a ladder

5 citations · 12 across the 9 of their papers we have counts for

collaborators

10 papers

math.CO2023

Powers of planar graphs, product structure, and blocking partitions

Marc Distel, Robert Hickingbotham, Michał T. Seweryn +1

We prove that the -power of any planar graph is contained in for some graph with bounded treewidth, some path , and some functio…

math.CO2023

Pathwidth vs cocircumference

Marcin Briański, Gwenaël Joret, Michał T. Seweryn

The {\em circumference} of a graph with at least one cycle is the length of a longest cycle in . A classic result of Birmelé (2003) states that the treewidth of is at mo…

math.CO2022

Edge separators for graphs excluding a minor

Gwenaël Joret, William Lochet, Michał T. Seweryn

We prove that every -vertex -minor-free graph of maximum degree has a set of edges such that every component of has at m…

math.CO2022★ 4 cited

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…

math.CO2022★ 1 cited

Three-dimensional graph products with unbounded stack-number

David Eppstein, Robert Hickingbotham, Laura Merker +3

We prove that the stack-number of the strong product of three -vertex paths is . The best previously known upper bound was . No non-trivial lower bound was kno…

math.CO2020

Erdős-Hajnal properties for powers of sparse graphs

Marcin Briański, Piotr Micek, Michał Pilipczuk +1

We prove that for every nowhere dense class of graphs , positive integer , and , the following holds: in every -vertex graph from $\mathcal{C}…

math.CO2020★ 5 cited

Excluding a ladder

Tony Huynh, Gwenaël Joret, Piotr Micek +2

A ladder is a grid graph. When does a graph class exclude some ladder as a minor? We show that this is the case if and only if all graphs in $\mathca…

math.CO2019

Improved bound for the dimension of posets of treewidth two

Michał T. Seweryn

Joret et al. proved that posets with cover graphs of treewidth at most 2 have dimension at most 1276. Their proof is long and very complex. We give a short and much simpler proof t…

stat.ME2015

Limit Theorems for Empirical Rényi Entropy and Divergence with Applications to Molecular Diversity Analysis

Maciej Pietrzak, Grzegorz A. Rempała, Michał Seweryn +1

Quantitative methods for studying biodiversity have been traditionally rooted in the classical theory of finite frequency tables analysis. However, with the help of modern experime…

q-bio.BM2010★ 2 cited

Model for Diversity Analysis of Antigen Receptor Repertoires

Grzegorz A. Rempala, Michal Seweryn, Leszek Ignatowicz

In most of the recent immunological literature the differences across antigen receptor populations are examined via non-parametric statistical measures of species overlap and diver…