2 papers
math.CO2025
Decomposing a signed graph into rooted circuits
Rose McCarty
We prove a precise min-max theorem for the following problem. Let be an Eulerian graph with a specified set of edges , and let be a vertex of . Then wh…
cs.LO2025
Flipper games for monadically stable graph classes
Jakub Gajarský, Nikolas Mählmann, Rose McCarty +6
A class of graphs is monadically stable if for any unary expansion of , one cannot interpret, in first-order logic, arbitrarily l…