A Characterization of Easily Testable Induced Digraphs and $k$-Colored Graphs
Combinatorics
2022-02-24 v2
Abstract
We complete the characterization of the digraphs for which the induced -removal lemma has polynomial bounds, answering a question of Alon and Shapira. We also study the analogous problem for -colored complete graphs. In particular, we prove a removal lemma with polynomial bounds for Gallai colorings.
Cite
@article{arxiv.2201.11447,
title = {A Characterization of Easily Testable Induced Digraphs and $k$-Colored Graphs},
author = {Lior Gishboliner},
journal= {arXiv preprint arXiv:2201.11447},
year = {2022}
}