Florian Gut

activity

20202026

most citedDecomposition of (infinite) digraphs along directed 1-separations

1 citations · 4 across the 10 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022★ 1 cited

Ubiquity of oriented rays

Florian Gut, Thilo Krill, Florian Reich

Call a digraph $H$ \emph{ubiquitous} if every digraph $D$ that contains $k$ vertex-disjoint copies of $H$ for every $k \in N$ also contains infinitely many vertex-disjoint…

math.CO2022

Maker-Breaker games on $K_{ω_{1}}$ and $K_{ω, ω_{1}}$

Nathan Bowler, Florian Gut, Attila Joó +1

We investigate Maker-Breaker games on graphs of size $ℵ_{1}$ in which Maker's goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the gam…

Ubiquity of oriented rays

Maker-Breaker games on Kω1​​ and Kω,ω1​​

Maker-Breaker games on $K_{ω_{1}}$ and $K_{ω, ω_{1}}$