3 papers
math.CO2026
Obstructions for Minor-Closed Classes of limiting Densities Below 3/2
Antonios Kominatos, Reem Mahmoud, Dimitrios M. Thilikos
Given a graph class , the limiting density of is defined as where $\mathsf{ex}(\mathcal{G…
math.CO2025
Equitably Coloring Planar and Outerplanar Graphs
Daniel W. Cranston, Reem Mahmoud
A proper -coloring of an -vertex graph is \emph{equitable} if every color class has size or . A necessary condition to have an equita…
math.CO2022
Reconstruction and Edge Reconstruction of Triangle-free Graphs
Alexander Clifton, Xiaonan Liu, Reem Mahmoud +1
The Reconstruction Conjecture due to Kelly and Ulam states that every graph with at least 3 vertices is uniquely determined by its multiset of subgraphs . Let $…