B. Moore

activity

20152023

most citedGraph Homomorphism Reconfiguration and Frozen

H

-Colourings

4 citations · 12 across the 17 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

4 papers · 2 filters

math.CO2022

The Strong Nine Dragon Tree Conjecture is true for $d \leq k + 1$

Sebastian Mies, Benjamin Moore

The arboricity $Γ (G)$ of an undirected graph $G = (V, E)$ is the minimal number such that $E$ can be partitioned into $Γ (G)$ forests. Nash-Williams' formula states that $k = \lceil…

math.CO2022★ 1 cited

Digraphs with all induced directed cycles of the same length are not $χ$ -bounded

Alvaro Carbonero, Patrick Hompe, Benjamin Moore +1

For $t \geq 2$ , let us call a digraph $D$ \emph{t-chordal} if all induced directed cycles in $D$ have length equal to $t$ . In a previous paper, we asked for which $t$ it is true tha…

math.CO2022

Local Hadwiger's Conjecture

Benjamin Moore, Luke Postle, Lise Turner

We propose local versions of Hadwiger's Conjecture, where only balls of radius $Ω (lo g (v (G)))$ around each vertex are required to be $K_{t}$ -minor-free. We ask: if a graph is local…

math.CO2022★ 1 cited

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

Alvaro Carbonero, Patrick Hompe, Benjamin Moore +1

We prove that for every $n$ , there is a graph $G$ with $χ (G) \geq n$ and $ω (G) \leq 3$ such that every induced subgraph $H$ of $G$ with $ω (H) \leq 2$ satisfies $χ (H) \leq 4$ . This…

The Strong Nine Dragon Tree Conjecture is true for d≤k+1

Digraphs with all induced directed cycles of the same length are not χ​-bounded

Local Hadwiger's Conjecture

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

The Strong Nine Dragon Tree Conjecture is true for $d \leq k + 1$

Digraphs with all induced directed cycles of the same length are not $χ$ -bounded