Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
@inproceedings{DMT24, address = {New York, NY, USA}, author = {Dreier, Jan and Mählmann, Nikolas and Toruńczyk, Szymon}, booktitle = {Proceedings of the 56th Annual ACM Symposium on Theory of Computing}, doi = {10.1145/3618260.3649739}, isbn = {9798400703836}, keywords = {Monadically dependent, algorithmic model theory, first-order model checking, monadically NIP, structural graph theory}, location = {Vancouver, BC, Canada}, numpages = {11}, pages = {1550–1560}, publisher = {Association for Computing Machinery}, series = {STOC 2024}, title = {Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes}, url = {https://doi.org/10.1145/3618260.3649739}, year = {2024} }