2000 character limit reached
A Characterization of Easily Testable Induced Digraphs and $k$-Colored Graphs
Published 27 Jan 2022 in math.CO | (2201.11447v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.