A version of Szemer\'edi's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs
Combinatorics
2016-05-24 v2
Abstract
In this manuscript we develop a version of Szemer\'edi's regularity lemma that is suitable for analyzing multicolorings of complete graphs and directed graphs. In this, we follow the proof of Alon, Fischer, Krivelevich and M. Szegedy [Combinatorica, 20(4) (2000), 451--476] who prove a similar result for graphs. The purpose is to extend classical results on dense hereditary properties, such as the speed of the property or edit distance, to the above-mentioned combinatorial objects.
Keywords
Cite
@article{arxiv.1106.2871,
title = {A version of Szemer\'edi's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs},
author = {Maria Axenovich and Ryan R. Martin},
journal= {arXiv preprint arXiv:1106.2871},
year = {2016}
}
Comments
11 pages