Marcin Brianski

activity

20202026

most citedTreedepth vs circumference

4 citations · 8 across the 7 of their papers we have counts for

collaborators

9 papers

math.RT2026

Universally extendible characters

Benjamin Sambale

Let theta be an ordinary character or a Brauer character of a finite group N. We show that theta extends to every overgroup $G = G_{θ} ⊵ N$ if and only if Z(N) <= Ker(the…

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.CO2024

Erdős-Pósa property of tripods in directed graphs

Marcin Briański, Meike Hatzel, Karolina Okrasa +1

Let $D$ be a directed graphs with distinguished sets of sources $S \subseteq V (D)$ and sinks $T \subseteq V (D)$ . A tripod in $D$ is a subgraph consisting of the union of two $S$ - $T$ -…

math.CO2024★ 1 cited

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 $μ (T)$ denote the maximum size of an induced matching in $G$ with the property that some bag of $T$ c…

math.CO2024

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…

math.CO2023★ 1 cited

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.CO2022★ 4 cited

Treedepth vs circumference

Marcin Briański, Gwenaël Joret, Konrad Majewski +3

The circumference of a graph $G$ is the length of a longest cycle in $G$ , or $+ \infty$ if $G$ has no cycle. Birmelé (2003) showed that the treewidth of a graph $G$ is at most its c…

math.CO2021★ 2 cited

Reconfiguring Independent Sets on Interval Graphs

Marcin Briański, Stefan Felsner, Jędrzej Hodor +1

We study reconfiguration of independent sets in interval graphs under the token sliding rule. We show that if two independent sets of size $k$ are reconfigurable in an $n$ -vertex i…

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 $C$ , positive integer $d$ , and $ε > 0$ , the following holds: in every $n$ -vertex graph $G$ from $\mathcal{C}…