Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
