3 papers
cs.LO2026
Order-invariant cluster first-order logic on graph classes of bounded degree
Fatemeh Ghasemi, Julien Grange
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant fo…
math.CO2026
Transducing Linear Decompositions of Tournaments
Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kanté
BojaÅczyk, Pilipczuk, and Grohe [LICS '18] proved that for graphs of bounded linear clique-width, clique-decompositions of bounded width can be produced by a CMSO transduction. We…
cs.DM2025
Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté +1
In this work we take a step towards characterising strongly flip-flat classes of graphs. Strong flip-flatness appears to be the analogue of uniform almost-wideness in the setting o…