B. Moore

activity

20172023

most citedGraph Homomorphism Reconfiguration and Frozen

H

-Colourings

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

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

An Approximate Version of the Strong Nine Dragon Tree Conjecture

Benjamin Moore

The Strong Nine Dragon Tree Conjecture asserts that for any integers $k$ and $d$ any graph with fractional arboricity at most $k + \frac{d}{d + k + 1}$ decomposes into $k + 1$ forests, s…

math.CO2019

The Pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is True

Logan Grout, Benjamin Moore

We prove that for any positive integers $k$ and $d$ , if a graph $G$ has maximum average degree at most $2 k + \frac{2 d}{d + k + 1}$ , then $G$ decomposes into $k + 1$ pseudoforests $C_{1},…

math.CO2019★ 2 cited

On Decomposing Graphs Into Forests and Pseudoforests

Logan Grout, Benjamin Moore

We prove that for $k \in N$ and $d \leq 2 k + 2$ , if a graph has maximum average degree at most $2 k + \frac{2 d}{d + k + 1}$ , then $G$ decomposes into $k + 1$ pseudoforests, where o…