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

Showing 2015Show all

2 papers · 1 filter

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…