Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes

Dreier, Jan; Mählmann, Nikolas; Toruńczyk, Szymon

doi:10.1145/3618260.3649739

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Other2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

First-Order Model Checking on Monadically Stable Graph Classes

Dreier,

Eleftheriadis,

Mählmann

et al. 2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

First-Order Model Checking on Monadically Stable Graph Classes

Dreier,

Eleftheriadis,

Mählmann

et al. 2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes

Dreier,

Mählmann,

Toruńczyk

2024

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

View full text Add to dashboard Cite

Shallow vertex minors, stability, and dependence

Buffière,

Kim,

Ossona de Mendez

2024

Innovations in Graph Theory

View full text Add to dashboard Cite

Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and algorithmic properties of hereditary graph classes, and are considered key notions for generalizing to hereditary graph classes the theory of sparsity developed for monotone graph classes (where an essential notion is that of nowhere dense class). The theory of sparsity was initially built on the notion of shallow minors and on the idea of excluding different sets of minors, depending on the depth at which these minors can appear.In this paper, we follow a similar path, where shallow vertex minors replace shallow minors. In this setting, we provide a neat characterization of stable / dependent hereditary classes of graphs: A hereditary class of graphs C is dependent if and only if it does not contain all permutation graphs and, for each integer r, it excludes some split interval graph as a depth-r vertex minor; it is stable if and only if, for each integer r, it excludes some half-graph as a depth-r vertex minor.A key ingredient in proving these results is the preservation of stability and dependence of a class when taking bounded depth shallow vertex minors. We extend this preservation result to binary structures and get, as a direct consequence, that bounded depth shallow vertex minors of graphs with bounded twin-width have bounded twin-width.

show abstract

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes

Cited by 3 publications

References 32 publications

First-Order Model Checking on Monadically Stable Graph Classes

First-Order Model Checking on Monadically Stable Graph Classes

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes

Shallow vertex minors, stability, and dependence

Contact Info

Product

Resources

About