论文标题
易于测试的诱导挖掘物和$ k $颜色的图表的表征
A Characterization of Easily Testable Induced Digraphs and $k$-Colored Graphs
论文作者
论文摘要
我们完成了Digraphs $ d $的表征，该$ D $ d $ d $ - 拆除引理具有多项式界限，回答了Alon和Shapira的问题。我们还研究了$ k $颜色的完整图的类似问题。特别是，我们证明了具有多项式界限的去除引理。
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.
