Emily Heath

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Online Ramsey numbers of ordered paths and cycles
The Electronic Journal of Combinatorics
2025-01-27Paper
New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
Discrete Mathematics
2024-05-21Paper
Asymmetric Ramsey properties of randomly perturbed graphs
 
2023-11-01Paper
Lower bounds on the Erdős–Gyárfás problem via color energy graphs
Journal of Graph Theory
2023-10-12Paper
Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class
 
2023-07-03Paper
The maximum number of odd cycles in a planar graph
 
2023-06-30Paper
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
Combinatorics, Probability and Computing
2023-04-03Paper
Embedded graph 3-coloring and flows
 
2023-03-09Paper
A strengthening of the Erdős-Szekeres theorem
European Journal of Combinatorics
2022-01-13Paper
Generalized rainbow Turán numbers of odd cycles
Discrete Mathematics
2021-11-23Paper
Hypergraph Models of Biological Networks to Identify Genes Critical to Pathogenic Viral Response
 
2020-10-06Paper
New Upper Bounds for the Erd\H{o}s-Gy\'arf\'as Problem on Generalized Ramsey Numbers
 
2020-06-16Paper
Ordered size Ramsey number of paths
Discrete Applied Mathematics
2020-04-01Paper
Scheduling of tasks with effectiveness precedence constraints
Optimization Letters
2020-02-27Paper
A (5,5)-Colouring of Kn with Few Colours
Combinatorics, Probability and Computing
2018-11-09Paper
Applying ranking and selection procedures to long-term mitigation for improved network restoration
EURO Journal on Computational Optimization
2016-11-11Paper
Economical extremal hypergraphs for the Erdős-Selfridge theorem
Discrete Mathematics
2016-06-20Paper
Online Ramsey numbers of ordered paths and cycles
 
N/APaper
New bounds on the generalized Ramsey number $f(n,5,8)$
 
N/APaper
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
 
N/APaper


Research outcomes over time


This page was built for person: Emily Heath