David Fabian

collaborators

2 papers

math.CO2023

Slow graph bootstrap percolation I: Cycles

David Fabian, Patrick Morris, Tibor Szabó

Given a fixed graph $H$ and an $n$ -vertex graph $G$ , the $H$ \emph{-bootstrap percolation process} on $G$ is defined to be the sequence of graphs $G_{i}$ , $i \geq 0$ which starts with…

math.CO2022

Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets

Michael Anastos, David Fabian, Alp Müyesser +1

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_{1}$ , $M_{2}$ , and $M_{3}$ . Given such a graph $G$ and any $a_{1}, a_{2}, a_{3} \in N$ with $a_1+a_2+a_3…