Megan E. Heenehan

activity

20122021

collaborators

3 papers

math.CO2021

A Note on the Immersion Number of Generalized Mycielski Graphs

Karen L. Collins, Megan E. Heenehan, Jessica McDonald

The immersion number of a graph $G$ , denoted im $(G)$ , is the largest $t$ such that $G$ has a $K_{t}$ -immersion. In this note we are interested in determining the immersion number of…

math.CO2019

Clique immersion in graph products

Karen L. Collins, Megan E. Heenehan, Jessica McDonald

Let $G, H$ be graphs and $G * H$ represent a particular graph product of $G$ and $H$ . We define $im (G)$ to be the largest $t$ such that $G$ has a $K_{t}$ -immersion and ask: given $im(G)…

math.CO2012

Constructing graphs with no immersion of large complete graphs

Karen L. Collins, Megan E. Heenehan

In 1989, Lescure and Meyniel proved, for $d = 5, 6$ , that every $d$ -chromatic graph contains an immersion of $K_{d}$ , and in 2003 Abu-Khzam and Langston conjectured that this holds for…