Counting rainbow triangles in edge-colored graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908592978788352 |
|---|---|
| author | Li, Xueliang Ning, Bo Shi, Yongtang Zhang, Shenggui |
| author_facet | Li, Xueliang Ning, Bo Shi, Yongtang Zhang, Shenggui |
| contents | Let $G$ be an edge-colored graph on $n$ vertices. The minimum color degree of $G$, denoted by $δ^c(G)$, is defined as the minimum number of colors assigned to the edges incident to a vertex in $G$. In 2013, H. Li proved that an edge-colored graph $G$ on $n$ vertices contains a rainbow triangle if $δ^c(G)\geq \frac{n+1}{2}$. In this paper, we obtain several estimates on the number of rainbow triangles through one given vertex in $G$. As consequences, we prove counting results for rainbow triangles in edge-colored graphs. One main theorem states that the number of rainbow triangles in $G$ is at least $\frac{1}{6}δ^c(G)(2δ^c(G)-n)n$, which is best possible by considering the rainbow $k$-partite Turán graph, where its order is divisible by $k$. This means that there are $Ω(n^2)$ rainbow triangles in $G$ if $δ^c(G)\geq \frac{n+1}{2}$, and $Ω(n^3)$ rainbow triangles in $G$ if $δ^c(G)\geq cn$ when $c>\frac{1}{2}$. Both results are tight in sense of the order of the magnitude. We also prove a counting version of a previous theorem on rainbow triangles under a color neighborhood union condition due to Broersma et al., and an asymptotically tight color degree condition forcing a colored friendship subgraph $F_k$ (i.e., $k$ rainbow triangles sharing a common vertex). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_14458 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Counting rainbow triangles in edge-colored graphs Li, Xueliang Ning, Bo Shi, Yongtang Zhang, Shenggui Combinatorics Let $G$ be an edge-colored graph on $n$ vertices. The minimum color degree of $G$, denoted by $δ^c(G)$, is defined as the minimum number of colors assigned to the edges incident to a vertex in $G$. In 2013, H. Li proved that an edge-colored graph $G$ on $n$ vertices contains a rainbow triangle if $δ^c(G)\geq \frac{n+1}{2}$. In this paper, we obtain several estimates on the number of rainbow triangles through one given vertex in $G$. As consequences, we prove counting results for rainbow triangles in edge-colored graphs. One main theorem states that the number of rainbow triangles in $G$ is at least $\frac{1}{6}δ^c(G)(2δ^c(G)-n)n$, which is best possible by considering the rainbow $k$-partite Turán graph, where its order is divisible by $k$. This means that there are $Ω(n^2)$ rainbow triangles in $G$ if $δ^c(G)\geq \frac{n+1}{2}$, and $Ω(n^3)$ rainbow triangles in $G$ if $δ^c(G)\geq cn$ when $c>\frac{1}{2}$. Both results are tight in sense of the order of the magnitude. We also prove a counting version of a previous theorem on rainbow triangles under a color neighborhood union condition due to Broersma et al., and an asymptotically tight color degree condition forcing a colored friendship subgraph $F_k$ (i.e., $k$ rainbow triangles sharing a common vertex). |
| title | Counting rainbow triangles in edge-colored graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2112.14458 |