Matthew Yancey

activity

20122024

most citedLarge rainbow matchings in large graphs

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

collaborators

4 papers

math.CO2024

Partition of Sparse Graphs into Two Forests with Bounded Degree

Matthew Yancey

Borodin and Kostochka proved that for $d_{2} \geq 2 d_{1} + 2$ and a graph $G$ where every subgraph $H$ satisfies $$ e(H) < \left(2 - \frac{d_2+2}{(d_1+2)(d_2+1)}\right)n(H) + \frac{1}{d_…

math.CO2016

Three Ways to Count Walks in a Digraph

Matthew Yancey

We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.

math.CO2015★ 1 cited

Coloring the square of a sparse graph $G$ with almost $Δ (G)$ colors

Matthew Yancey

For a graph $G$ , let $G^{2}$ be the graph with the same vertex set as $G$ and $x y \in E (G^{2})$ when $x \neq = y$ and $d_{G} (x, y) \leq 2$ . Bonamy, Lévêque, and Pinlou conjectured that if $…

math.CO2012★ 7 cited

Large rainbow matchings in large graphs

Alexandr Kostochka, Florian Pfender, Matthew Yancey

A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on…

Partition of Sparse Graphs into Two Forests with Bounded Degree

Three Ways to Count Walks in a Digraph

Coloring the square of a sparse graph G with almost Δ(G) colors

Large rainbow matchings in large graphs

Coloring the square of a sparse graph $G$ with almost $Δ (G)$ colors