REVIEW 2 cited by
A version of Szemer\'edi's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Packing tetrahedrons in edge-weighted graphs
A minimum weighted degree above ((1+3t)/4)n suffices to force a perfect packing by K4s of total weight greater than 6t in every large edge-weighted complete graph.
-
Ramsey multiplicity for ordered graphs
Weighted ordered Ramsey multiplicity grows polynomially, with a general lower-bound amplification inequality and explicit upper constructions for ordered stars and matchings.
Discussion (0). Sign in to comment.