Andrew McConvey

activity

20152017

collaborators

4 papers

math.CO2017

A sharp Dirac-Erdős type bound for large graphs

Henry A. Kierstead, Alexandr V. Kostochka, Andrew McConvey

Let $k \geq 3$ be an integer, $h_{k} (G)$ be the number of vertices of degree at least $2 k$ in a graph $G$ , and $ℓ_{k} (G)$ be the number of vertices of degree at most $2 k - 2$ in $…

math.CO2016

Strengthening theorems of Dirac and Erdős on disjoint cycles

Henry A. Kierstead, Alexandr V. Kostochka, Andrew McConvey

Let $k \geq 3$ be an integer, $H_{k} (G)$ be the set of vertices of degree at least $2 k$ in a graph $G$ , and $L_{k} (G)$ be the set of vertices of degree at most $2 k - 2$ in $G$ . In 196…

math.CO2015

Toward Żak's conjecture on graph packing

Ervin Győri, Alexandr Kostochka, Andrew McConvey +1

Two graphs $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ , each of order $n$ , pack if there exists a bijection $f$ from $V_{1}$ onto $V_{2}$ such that $uv \in E_{1}$ implies…

math.CO2015

A list version of graph packing

Ervin Győri, Alexandr Kostochka, Andrew McConvey +1

We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \cup V_{2}, E_{3})$ …