Marcin Brianski

collaborators

4 papers

math.CO2025

Defective and Clustered Colouring of Graphs with Given Girth

Marcin BriaÅski, Robert Hickingbotham, David R. Wood

The defective chromatic number of a graph class $G$ is the minimum integer $k$ such that for some integer $d$ , every graph in $G$ is $k$ -colourable such that ea…

cs.DS2025

On Integer Programs That Look Like Paths

Marcin BriaÅski, Alexandra Lassota, KristÃ½na PekÃ¡rkovÃ¡ +2

Solving integer programs of the form $min {x ∣ A x = b, l \leq x \leq u, x \in Z^{n}}$ is, in general, $…

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…

math.CO2024

Excluding a clique or a biclique in graphs of bounded induced matching treewidth

Tara Abrishami, Marcin BriaÅski, Jadwiga CzyÅ¼ewska +4

For a tree decomposition $T$ of a graph $G$ , let $I^¼ (T)$ denote the maximum size of an induced matching in $G$ with the property that some bag of $T$ …