Economical extremal hypergraphs for the Erdős-Selfridge theorem. - Emily Heath; Eric Sundberg 001 (Discret. Math., 2016)

A (5, 5)-Colouring of Kn with Few Colours. - Alex Cameron; Emily Heath (Comb. Probab. Comput., 2018)

Ordered size Ramsey number of paths. - József Balogh; Felix Christian Clemen; Emily Heath; Mikhail Lavrov (Discret. Appl. Math., 2020)

Hypergraph models of biological networks to identify genes critical to pathogenic viral response. - Song Feng; Emily Heath; Brett A. Jefferson; Cliff A. Joslyn; Henry Kvinge; Hugh D. Mitchell; Brenda Praggastis; Amie J. Eisfeld; Amy C. Sims; Larissa B. Thackray; Shufang Fan; Kevin B. Walters; et al. (BMC Bioinform., 2021)

Generalized rainbow Turán numbers of odd cycles. - József Balogh; Michelle Delcourt; Emily Heath; Lina Li (Discret. Math., 2022)

A strengthening of the Erdős-Szekeres Theorem. - József Balogh; Felix Christian Clemen; Emily Heath; Mikhail Lavrov (Eur. J. Comb., 2022)

Embedded graph 3-coloring and flows. - Caroline Bang; Zdenek Dvorák 001; Emily Heath; Bernard Lidický (CoRR, 2023)

New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers. - Alex Cameron; Emily Heath (Comb. Probab. Comput., 2023)

Lower bounds on the Erdős-Gyárfás problem via color energy graphs. - József Balogh; Sean English; Emily Heath; Robert A. Krueger (J. Graph Theory, 2023)

Online Ramsey Numbers of Ordered Paths and Cycles. - Felix Christian Clemen; Emily Heath; Mikhail Lavrov (Electron. J. Comb., 2024)

New bounds on the generalized Ramsey number f(n,5,8). - Enrique Gomez-Leos; Emily Heath; Alex Parker; Coy Schwieder; Shira Zerbib (Discret. Math., 2024)

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs. - James Anderson; Herman Chau; Eun-Kyung Cho; Nicholas Crawford; Stephen G. Hartke; Emily Heath; Owen Henderschedt; Hyemin Kwon; Zhiyuan Zhang (Discret. Math., 2025)

The maximum number of odd cycles in a planar graph. - Emily Heath; Ryan R. Martin; Chris Wells (J. Graph Theory, 2025)