E. Yeager

activity

20132016

most citedA note on list-coloring powers of graphs

8 citations · 14 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2016★ 1 cited

On the Corrádi-Hajnal Theorem and a question of Dirac

H. A. Kierstead, A. V. Kostochka, E. C. Yeager

In 1963, Corrádi and Hajnal proved that for all $k \geq 1$ and $n \geq 3 k$ , every graph $G$ on $n$ vertices with minimum degree $δ (G) \geq 2 k$ contains $k$ disjoint cycles. The bound $δ(…

math.CO2015

A refinement of theorems on vertex-disjoint chorded cycles

Theodore Molla, Michael Santana, Elyse Yeager

In 1963, Corrádi and Hajnal settled a conjecture of Erdős by proving that, for all $k \geq 1$ , any graph $G$ with $∣ G ∣ \geq 3 k$ and minimum degree at least $2 k$ contains $k$ vertex…

math.CO2015

Graphs with induced-saturation number zero

Sarah Behrens, Catherine Erbes, Michael Santana +2

Given graphs $G$ and $H$ , $G$ is $H$ -saturated if $H$ is not a subgraph of $G$ , but for all $e \in / E (G)$ , $H$ appears as a subgraph of $G + e$ . While for every $n \geq ∣ V (H) ∣$ , t…

math.CO2014★ 5 cited

The (2k-1)-connected multigraphs with at most k-1 disjoint cycles

H. A. Kierstead, A. V. Kostochka, E. C. Yeager

In 1963, Corrádi and Hajnal proved that for all $k \geq 1$ and $n \geq 3 k$ , every (simple) graph on n vertices with minimum degree at least 2k contains k disjoint cycles. The same ye…

math.CO2014

Large subposets with small dimension

Benjamin Reiniger, Elyse Yeager

Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$ -element poset. A lower bound of order $n$ was found by Goodwillie. We provide a sublinear…

math.CO2013★ 8 cited

A note on list-coloring powers of graphs

Nicholas Kosar, Sarka Petrickova, Benjamin Reiniger +1

Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some $k$ such that all $k$ th power graph…