Show Summary Details
More options …

# Open Mathematics

### formerly Central European Journal of Mathematics

Editor-in-Chief: Vespri, Vincenzo / Marano, Salvatore Angelo

IMPACT FACTOR 2018: 0.726
5-year IMPACT FACTOR: 0.869

CiteScore 2018: 0.90

SCImago Journal Rank (SJR) 2018: 0.323
Source Normalized Impact per Paper (SNIP) 2018: 0.821

Mathematical Citation Quotient (MCQ) 2018: 0.34

ICV 2018: 152.31

Open Access
Online
ISSN
2391-5455
See all formats and pricing
More options …
Volume 15, Issue 1

# Avoiding rainbow 2-connected subgraphs

Izolda Gorgol
• Corresponding author
• Department of Applied Mathematics, Lublin University of Technology, Nadbystrzycka 38D, 20-618 Lublin, Poland
• Email
• Other articles by this author:
Published Online: 2017-04-17 | DOI: https://doi.org/10.1515/math-2017-0035

## Abstract

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.

MSC 2010: 05C55; 05C35

## 1 Introduction

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. In 1973 Erdős, Simonovits and Sós [1] introduced the anti-Ramsey numbers as follows. For a graph H and a positive integer n, the anti-Ramsey number a r(Kn, H) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H. The authors showed that these numbers are closely related to Turán numbers, especially for the cases when H is neither bipartite nor become bipartite after deleting a single edge. Among others, they constructed colorings avoiding rainbow cycles. They also mentioned that these colorings may not be unique.

Since then, numerous results have been established for a variety of graphs H. The paper of Fujita, Magnant and Ozeki [2] presents the survey of results of that type. Apart from that, the definition of anti-Ramsey number was widen by substituting the complete graph, to be colored, by some other graph, namely, for graphs G and H anti-Ramsey number a r(G, H) is the maximum number of colors in an edge-coloring of G with no rainbow copy of H. For instance, bipartite graphs [3, 4] or hypercubes [5] were considered as host graphs.

In the paper we formalize the construction of extremal colorings given in [1] and discuss their uniqueness. We use the concept to construct the colorings of complete split graphs which avoid rainbow 2-connected subgraphs. These colorings establish the lower bound for anti-Ramsey number a r(Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ , H) for any 2-connected graph H.

Graphs considered below will always be simple, i.e. without loops and multiple edges. Throughout the paper we use the standard graph theory notation (see, e.g., [6]). V(G) and E(G) denote the vertex-set and the edge-set of a graph G, respectively. GH stands for disjoint sum of graphs G and H, pG denotes a graph consisting of p disjoint copies of a graph G and $\begin{array}{}\overline{G}\end{array}$ a complement of G. Kn, Cn denote, respectively, the complete graph and the cycle on n vertices. For a set S by |S| we denote the cardinality of S.

A join of graphs G and H is a graph F = G + H such that V(F) = V(G) ∪ V(H) and the edge-set E(F) = E(G) ∪ E(H) ∪ {vw : vV(G), wV(H)}. A complete split graph Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ is a join of a complete graph Kn and an empty graph $\begin{array}{}\overline{{K}_{s}}\end{array}$.

In other words a graph is a complete split graph if it can be partitioned in a clique Kn and an independent set $\begin{array}{}\overline{{K}_{s}}\end{array}$ in such a way that every vertex in the independent set is adjacent to every vertex in the clique.

## 2 ESS coloring

As we mentioned in [1] Erdős, Simonovits and Sós presented the edge-coloring of Kn avoiding rainbow cycles. This coloring is roughly described by the authors as follows. To avoid rainbow Ck we divide the vertices of Kn into $\begin{array}{}\frac{n}{k-1}\end{array}$ of k−1 vertices. Then, we color all edges joining the vertices of the same group by different colors and edges joining the vertices from different groups by further $\begin{array}{}\frac{n}{k-1}\end{array}$ colors in the following way: the vertices of the i-th group are joined by i-th extra color to the vertices of the j-th group if j > i.

Certainly, in a particular case, the appropriate floor and ceiling functions of $\begin{array}{}\frac{n}{k-1}\end{array}$ should be used and one group with less than k−1 vertices can appear.

#### Remark 2.1

Note that the presented coloring also works if arbitrary rainbow 2-connected subgraph is forbidden.

The authors themselves mentioned that they do not focus on uniqueness of this coloring and conjectured that this construction uses maximum possible number of colors. The conjecture was proved by them for a triangle, for a 4-cycle by Alon [7], for k = 5, 6 Jiang and West [8] and finally completely confirmed by Montellano-Ballesteros and Neuman-Lara [9].

We try to generalize and formalize this very intuitive construction of Erdős, Simonovits and Sós.

#### Definition 2.2

Let G be a connected graph and let $\begin{array}{}V\left(G\right)=\bigcup _{i=1}^{t}\phantom{\rule{thinmathspace}{0ex}}{V}_{i}\end{array}$ be a partition of the vertex set of G, such that each Ci = G[Vi] is connected and for each i = 1, 2…, t−1 there exists at least one edge between Ci and Cj, for certain j ∊ {i+1, …, t}. We color the edges inside Ci rainbowly and among the components in a following way. All edges vivj with viVi, vjVj, 1≤ i < jt obtain i-th extra color. We say that we use ESS coloring to the partition into components (C1, C2, …, Ct).

In case of components isomorphic to C in the sequence we will write (…, pC,…) instead of $\begin{array}{}\left(\dots ,\underset{p}{\underset{⏟}{C,C,\dots ,C}},\dots \right).\end{array}$

#### Remark 2.3

Note that in the original coloring of Erdős, Simonovits and Sós the components were cliques on k−1 vertices and maybe one clique with less vertices and all edges among components were present.

#### Remark 2.4

Note that we use $\begin{array}{}\bigcup _{i=1}^{t}|E\left({C}^{i}\right)|+\left(t-1\right)\end{array}$ colors in ESS coloring.

#### Remark 2.5

Note that the ESS coloring avoids 2-connected rainbow subgraphs of order greater then maxi |Vi|.

Therefore, the idea of constructing these colorings is to choose components with equal number of vertices one less than the order of the forbidden graph H. To maximize the number of colors they should contain as many edges as possible, which means that they should be as close to complete graph as possible. One can imagine other reasons for avoiding rainbow H than only the number of vertices. In this light coloring constructions presented by Axenovich et. al. in [4] avoiding rainbow even cycles in bipartite graphs can be seen as ESS colorings. The authors proposed the partition of Km,n into (Kk−1, n−(k−1), Km−(k−1),k−1) or ((mk+1)K1, Kk−1,n). In that way they avoid rainbow C2k and the reason is too few vertices in one of bipartition parts.

Further we discuss the uniqueness of the coloring. We do not give the formal definition of isomorphism of colorings. We simply understand that the colorings c1 and c2 are the same if there exists the permutation of colors π such that π(c1) = c2.

#### Remark 2.6

Although Erdős et. al. do not focus on uniqueness of colorings, they give accidentally two different colorings avoiding rainbow triangles. One is the special case of their intuitive construction for k = 3. It means that the components in ESS coloring are independent edges and possible one single vertex. The coloring uses $\begin{array}{}⌊\frac{n}{2}⌋+⌈\frac{n}{2}⌉-1=n-1\end{array}$ colors. On the other hand, in the proof of the theorem for triangles the authors present another coloring where components are simply vertices of Kn. Actually all “between coloring” are suitable in that case.

#### Proposition 2.7

There are at least $\begin{array}{}⌊\frac{n}{2}⌋\end{array}$ different colorings of Kn with n−1 colors avoiding the rainbow triangle.

#### Proof

Each partition (pK2, (n−2p)K1), p = 0, …, $\begin{array}{}⌊\frac{n}{2}⌋\end{array}$ − 1 together with ESS coloring is a coloring with n − 1 colors without rainbow triangle.     □

It is worth noticing that we end with parameter p = $\begin{array}{}⌊\frac{n}{2}⌋\end{array}$ − 1, because partitions ( $\begin{array}{}⌊\frac{n}{2}⌋\end{array}$ K2, K1) and (( $\begin{array}{}⌊\frac{n}{2}⌋\end{array}$ − 1)K2, 3K1) generate the same colorings.

Apart from that, not all colorings are characterized by the above partition. For instance, for n = 5 coloring induced by (2K2, K1) partition is different than that induced by (K1, 2K2). The latter appears to be different from all of the type (pK2, (5−2p)K1), p = 0, 1. On the other hand, not all possible partitions give different colorings. For instance colorings induced by the partitions (5K1) and (3K1, K2) are the same. In the Figure 1 colorings induced by all possible partitions of vertices of K5 into components K2 and K1 are presented. In the first row there are colorings from Proposition 2.7 for p = 0, 1. In the remaining rows there are colorings induced by all other possible partitions. Colorings in the first and the second columns are the same. Second row contains all different colorings of K5 without rainbow triangle.

Figure 1

4-colorings of edges of K5 without rainbow K3

Observe that this diversity of colorings without rainbow triangles comes from the fact that the color of the only edge in the component K2 can be sometimes exchanged into one color among two components, which arise by replacing this component by two components K1. It means that in that case we can substitute “main” component Kk−1 = K2 by two “reminder” components K1. While avoiding C4, for example, we cannot change the order of “main” components, which are K3, in extremal colorings. Nevertheless, different colorings can be constructed by placing the remaining component Kr, with r = n mod 3, r ≠ 0, in the different positions in the sequence of components. Apart from that, for r = 2 we can again sometimes substitute K2 by 2K1 to generate new coloring.

Therefore, it is a challenge to characterize all extremal colorings, but undoubtely worth considering. It seems to be as complicated as characterization of Túran extremal graphs or Ramsey extremal graphs.

## 3 Application of ESS colorings to complete split graphs

In this section we show how to apply the ESS coloring to construct colorings of complete split graphs avoiding rainbow 2-connected subgraph H. As a result we obtain the lower bounds for anti-Ramsey number a r(Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ , H) depending on n, s and k = |V(H)|. As we always refer to ESS colorings in the proofs, we only indicate a procedure of creating a sequence of components. As we know (see Remark 2.1), the ESS coloring avoids 2-connected subgraph.

We start with the graphs which are large in comparison to a complete part of the split graph.

#### Theorem 3.1

Let n ≥ 2, s ≥ 1, k ≥ 3 and n + sk. Let H be an arbitrary 2-connected graph on kn + 1 vertices. Then there exists an edge-coloring of $\begin{array}{}{K}_{n}+\overline{{K}_{s}}\phantom{\rule{thinmathspace}{0ex}}with\phantom{\rule{thinmathspace}{0ex}}\left(\begin{array}{}\genfrac{}{}{0}{}{n}{2}\end{array}\right)+\left(n-1\right)\left(k-1-n\right)+s\end{array}$ colors avoiding rainbow H.

#### Proof

The sequence of components is as follows: firstly we take s−(k − 1 − n)K1 from the empty part and the last component is the remaining complete split graph. $\begin{array}{}{K}_{n}+\overline{{K}_{k-1-n}}.\end{array}$ Certainly we use $\begin{array}{}\left(\begin{array}{}\genfrac{}{}{0}{}{n}{2}\end{array}\right)\end{array}$ + n(k − 1 − n)+s − (k − 1 − n) = $\begin{array}{}\left(\begin{array}{}\genfrac{}{}{0}{}{n}{2}\end{array}\right)\end{array}$ +(n − 1)(k − 1 − n)+s colors.     □

We obtain a straightforward corollary.

#### Corollary 3.2

Let n ≥ 2, s ≥ 1, k ≥ 3 and n+sk. Let H be an arbitrary 2-connected graph on kn+1 vertices. Then a r $\begin{array}{}\left({K}_{n}+\overline{{K}_{s}},H\right)\ge \left(\begin{array}{}\genfrac{}{}{0}{}{n}{2}\end{array}\right)+\left(n-1\right)\left(k-1-n\right)+s.\end{array}$

Now we focus on the cases when the order of the graph H is comparable with the order of a complete part of the split graph.

#### Theorem 3.3

Let n ≥ 2, k ≥ 3, $\begin{array}{}s\le ⌊\frac{n}{k-2}⌋,r=\left(n+s\right)-⌊\frac{n+s}{k-1}⌋\left(k-1\right)\end{array}$ and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of $\begin{array}{}{K}_{n}+\overline{{K}_{s}}\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}with\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}⌊\frac{n+s}{k-1}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+⌈\frac{n+s}{k-1}⌉-1\end{array}$ colors avoiding rainbow H.

#### Proof

The sequence of components is as follows. Firstly, we take sKk−2 contained in a complete part Kn. To each clique Kk−2 we add exactly one vertex from the empty part $\begin{array}{}\overline{{K}_{s}}\end{array}$ . In such a way we obtain s components Kk−1. Then we divide the remaining vertices of a complete part into cliques Kk−1 making next components being Kk−1. We may obtain a certain remainder clique Kr as the last component. Note that this procedure is equivalent to division the whole vertex-set of the graph Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ into cliques of order k−1 in such a way that each clique contains at most one vertex from the empty part. It is possible since s$\begin{array}{}⌊\frac{n}{k-2}⌋.\end{array}$ Altogether we use $\begin{array}{}⌊\frac{n+s}{k-1}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+⌈\frac{n+s}{k-1}⌉-1\end{array}$ colors.     □

#### Corollary 3.4

Let n ≥ 2, k ≥3, $\begin{array}{}s\le ⌊\frac{n}{k-2}⌋,r=\left(n+s\right)-⌊\frac{n+s}{k-1}⌋\left(k-1\right)\end{array}$ and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r $\begin{array}{}\left({K}_{n}+\overline{{K}_{s}},H\right)\ge ⌊\frac{n+s}{k-1}⌋\left(\begin{array}{l}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+⌈\frac{n+s}{k-1}⌉-1.\end{array}$

#### Theorem 3.5

Let n ≥ 2, k ≥ 3, $\begin{array}{}⌊\frac{n}{k-2}⌋=⌈\frac{n}{k-2}⌉,s>⌊\frac{n}{k-2}⌋\end{array}$ and n + sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of $\begin{array}{}{K}_{n}+\overline{{K}_{s}}\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}with\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}\frac{n}{k-2}\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+s-1\end{array}$ colors avoiding rainbow H.

#### Proof

The sequence of components is as follows. Firstly, we take s$\begin{array}{}\frac{n}{k-2}\phantom{\rule{thinmathspace}{0ex}}\end{array}$ components K1 from the empty part. Then we take $\begin{array}{}\frac{n}{k-2}\phantom{\rule{thinmathspace}{0ex}}\end{array}$ Kk−2 contained in a complete part Kn. To each clique Kk−2 we add exactly one vertex from the empty part $\begin{array}{}\overline{{K}_{s}}\end{array}$. In such a way we add $\begin{array}{}\frac{n}{k-2}\phantom{\rule{thinmathspace}{0ex}}\end{array}$ Kk−1 to the sequence of components. Altogether we use $\begin{array}{}\frac{n}{k-2}\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\frac{n}{k-2}-1+s-\frac{n}{k-2}=\frac{n}{k-2}\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+s-1\end{array}$ colors.     □

#### Corollary 3.6

Let n ≥ 2, k ≥ 3, $\begin{array}{}⌊\frac{n}{k-2}⌋=⌈\frac{n}{k-2}⌉,s>⌊\frac{n}{k-2}⌋\end{array}$ and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r $\begin{array}{}\left({K}_{n}+\overline{{K}_{s}},H\right)\ge \frac{n}{k-2}\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+s-1.\end{array}$

#### Theorem 3.7

Let n ≥ 2, k ≥ 3, $\begin{array}{}⌊\frac{n}{k-2}⌋<⌈\frac{n}{k-2}⌉,r=n-⌊\frac{n}{k-2}⌋\left(k-2\right),⌈\frac{n}{k-2}⌉\le s\le ⌈\frac{n}{k-2}⌉+k-r-1\end{array}$ and n + sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of Kn + $\begin{array}{}\overline{{K}_{s}}\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}with\phantom{\rule{thinmathspace}{0ex}}\phantom{\rule{thinmathspace}{0ex}}⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+r\left(s-⌊\frac{n}{k-2}⌋\right)+⌈\frac{n}{k-2}⌉-1\end{array}$ colors avoiding rainbow H.

#### Proof

The sequence of components is as follows. Firstly, we take $\begin{array}{}⌊\frac{n}{k-2}⌋\end{array}$ Kk−2 contained in a complete part Kn, to each clique Kk−2 we add exactly one vertex from the empty part $\begin{array}{}\overline{{K}_{s}}\end{array}$ . In such a way we obtain $\begin{array}{}⌊\frac{n}{k-2}⌋\end{array}$ components Kk−1. Then we form a complete split graph from remainining vertices as the last component. Altogether we use $\begin{array}{}⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+r\left(s-⌊\frac{n}{k-2}⌋\right)+⌈\frac{n}{k-2}⌉-1\end{array}$ colors.     □

#### Corollary 3.8

Let n ≥ 2, k ≥ 3, $\begin{array}{}⌊\frac{n}{k-2}⌋<⌈\frac{n}{k-2}⌉,r=n-⌊\frac{n}{k-2}⌋\left(k-2\right),⌈\frac{n}{k-2}⌉\le s\le ⌈\frac{n}{k-2}⌉+k-r-1\end{array}$ and n + sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r $\begin{array}{}\left({K}_{n}+\overline{{K}_{s}},H\right)\ge ⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+r\left(s-⌊\frac{n}{k-2}⌋\right)+⌈\frac{n}{k-2}⌉-1.\end{array}$

#### Theorem 3.9

Let n ≥ 2, k ≥ 3, $\begin{array}{}⌊\frac{n}{k-2}⌋<⌈\frac{n}{k-2}⌉,r=n-⌊\frac{n}{k-2}⌋\left(k-2\right),s>⌈\frac{n}{k-2}⌉+k-r-1\end{array}$ and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then there exists an edge-coloring of Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ with $\begin{array}{}⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+\left(r-1\right)\left(k-1-r\right)+s\end{array}$ colors avoiding rainbow H.

#### Proof

We color the edges of Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ as follows. Firstly, we take $\begin{array}{}\left(s-\left(\frac{n}{k-2}+k-1-r\right)\right)\end{array}$ K1 out of the empty part, then $\begin{array}{}⌊\frac{n}{k-2}⌋\end{array}$ Kk−2 contained in a complete part Kn, to each clique Kk−2 we add exactly one vertex from the empty part $\begin{array}{}\overline{{K}_{s}}\end{array}$ . In such a way we obtain next $\begin{array}{}⌊\frac{n}{k-2}⌋\end{array}$ components Kk−1 in the sequence. Finally, we take a complete split graph $\begin{array}{}{K}_{r}+\overline{{K}_{k-1-r}}\end{array}$ as the last component. Altogether we use $\begin{array}{}⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+r\left(k-1-r\right)+s-\left(⌊\frac{n}{k-2}⌋+k-1-r\right)+⌈\frac{n}{k-2}⌉-1=⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)+\left(r-1\right)\left(k-1-r\right)+s\end{array}$ colors.     □

#### Corollary 3.10

Let n ≥ 2, k ≥ 3, $\begin{array}{}⌊\frac{n}{k-2}⌋<⌈\frac{n}{k-2}⌉,r=n-⌊\frac{n}{k-2}⌋\left(k-2\right),s>⌈\frac{n}{k-2}⌉+k-r-1\end{array}$ and n+sk. Let H be an arbitrary 2-connected graph on kn vertices. Then a r $\begin{array}{}\left({K}_{n}+\overline{{K}_{s}},H\right)\ge ⌊\frac{n}{k-2}⌋\left(\begin{array}{}\genfrac{}{}{0}{}{k-1}{2}\end{array}\right)+\left(\begin{array}{}\genfrac{}{}{0}{}{r}{2}\end{array}\right)\end{array}$ + (r−1)(k−1−r)+s.

## 3.1 Optimality and uniqueness

It is difficult to claim that the colorings presented in the previous section are always optimal (looking at the number of colors used). While constructing these colorings, we pay attention only to the order of the 2-connected graph H and the fact that it is bridge-free. So it is quite possible that for a particular graph H a better coloring can be constructed looking at its structure. Nevertheless, there are cases that the constructions are best possible in that sense.

Consider the simplest 2-connected graph H = K3. For this graph we have k = 3 so by Theorems 3.3 and 3.5 we obtain the existence of the edge-coloring of Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ avoiding rainbow triangle with n + s − 1 colors. It is shown [10] that a r(Kn + $\begin{array}{}\overline{{K}_{s}}\end{array}$ , K3) = n+s−1. It means that the coloring presented in Theorems 3.3 and 3.5 use maximal possible number of colors. Note that these colorings use maximum matchings and possible single vertices as components and EES coloring. Similarly, as in the case of the complete graph considered as the host graph, changing the position of the componet K1 (if any), or replacing K2 by 2K1 we can obtain other colorings with n+s−1 colors avoiding rainbow K3. In other cases we can also create families of different colorings which avoid rainbow 2-connected subgraph. It is interesting if all of these colorings can be described using ESS colorings or maybe other constructions can appear. Another thing is to establish for which graphs presented colorings are optimal in the sense of number of colors used, i.e. which lower bounds for anti-Ramsey numbers are sharp.

## References

• [1]

Erdős P., Simonovits A., Sós V., Anti–Ramsey theorems, In: (A. Hajnal, R. Rado, and V.Sós, eds.) Infinite and finite sets (Colloq. Math. Soc. J. Bolyai, North-Holland, 1973), 633–643 Google Scholar

• [2]

Fujita S., Magnant C., Ozeki K., Rainbow Generalizations of Ramsey Theory: A Dynamic Survey, Theory and Applications of Graphs, firstly in Graphs and Combinatorics 26 (2010), 1–30 Google Scholar

• [3]

Axenovich M., Jiang T., Anti-Ramsey numbers for small complete bipartite graphs, Ars Combinatoria 73 (2004), 311–318 Google Scholar

• [4]

Axenovich M., Jiang T., Kündgen A., Bipartite anti-Ramsey numbers of cycles, J. Graph Theory 47 (2004), 9–28

• [5]

Axenovich M., Harborth H., Kemnitz A., Möller M., Schiermeyer I., Rainbows in the Hypercube, Graphs and Combinatorics 23 (2007), 123–133

• [6]

Diestel R., Graph theory (Springer-Verlag, New York, 1997) Google Scholar

• [7]

Alon N., On the conjecture of Erdős, Simonovits and Sós concerning anti-Ramsey theorems, J. Graph Theory 7 (1983), 91–94

• [8]

Jiang T., West D.B., On the Erdős-Simonovits-Sós conjecture about the anti-Ramsey number of a cycle, Combin. Probab. Comput. 12 (2003), 585–598

• [9]

Montellano-Ballesteros J.J., Neuman-Lara V., An anti-Ramsey theorem on cycles, Graphs and Combinatorics 21 (2005), 343–354

• [10]

Gorgol I., Anti-Ramsey numbers in complete split graphs, Discrete Mathematics 339(7), (2016), 1944–1949

Accepted: 2016-02-19

Published Online: 2017-04-17

Citation Information: Open Mathematics, Volume 15, Issue 1, Pages 393–397, ISSN (Online) 2391-5455,

Export Citation