Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
By: Fatemeh Ghasemi , Julien Grange , Mamadou Moustapha Kanté and more
Potential Business Impact:
Finds patterns in complex computer networks.
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 of dense classes of graphs. We prove that strongly flip-flat classes of graphs that are weakly sparse are indeed uniformly almost-wide.
Similar Papers
Separability Properties of Monadically Dependent Graph Classes
Combinatorics
Makes graphs easier to understand by changing parts.
Sandwich Monotonicity and the Recognition of Weighted Graph Classes
Discrete Mathematics
Helps computers quickly sort special kinds of graphs.
Graph Classes Closed under Self-intersection
Combinatorics
Finds faster computer problem solutions.