Avoidance in triple systems.
Avoiding 2-letter signed patterns.
Avoiding maximal parabolic subgroups of .
Avoiding rainbow 2-connected subgraphs
While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to construct the colorings of the edges of complete split graphs avoiding rainbow 2-connected subgraphs. These colorings give the lower bounds for adequate anti-Ramsey numbers.
Avoiding rainbow induced subgraphs in vertex-colorings.
Aztec diamonds and Baxter permutations.