TY - JOUR
T1 - A characterization of easily testable induced digraphs and k-colored graphs
AU - Gishboliner, Lior
N1 - Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/6
Y1 - 2022/6
N2 - We complete the characterization of the digraphs D for which the induced D-removal lemma has polynomial bounds, answering a question of Alon and Shapira. We also study the analogous problem for k-colored complete graphs. In particular, we prove a removal lemma with polynomial bounds for Gallai colorings.
AB - We complete the characterization of the digraphs D for which the induced D-removal lemma has polynomial bounds, answering a question of Alon and Shapira. We also study the analogous problem for k-colored complete graphs. In particular, we prove a removal lemma with polynomial bounds for Gallai colorings.
UR - http://www.scopus.com/inward/record.url?scp=85125277824&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2022.103516
DO - 10.1016/j.ejc.2022.103516
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85125277824
SN - 0195-6698
VL - 103
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
M1 - 103516
ER -