Matthew P. Yancey

collaborators

2 papers

math.CO2026

Resolving the Kohayakawa--Kreuter Conjecture for Families

Matthew Yancey

A graph $G$ is $(a, b)$ -sparse if every nonempty subgraph $H$ satisfies $e (H) \leq a v (H) - b$ . We are interested in the conditions under which an $(a, b)$ -sparse graph can be partit…

math.CO2025

Partition of Sparse Multigraphs into a Forest and a Forest with Restrictions

Ilkyoo Choi, Alexandr V. Kostochka, Matthew Yancey

The following measure of sparsity of multigraphs refining the maximum average degree: For $a > 0$ and an arbitrary real $b$ , a multigraph $H$ is \emph{ $(a, b)$ -sparse} if it is loople…