Cooperative colorings of hypergraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913460525203456 |
|---|---|
| author | Bai, Xuqing Li, Bi Liu, Weichan Zhang, Xin |
| author_facet | Bai, Xuqing Li, Bi Liu, Weichan Zhang, Xin |
| contents | Given a class $\mathcal{H}$ of $m$ hypergraphs ${H}_1, {H}_2, \ldots, {H}_m$ with the same vertex set $V$, a cooperative coloring of them is a partition $\{I_1, I_2, \ldots, I_m\}$ of $V$ in such a way that each $I_i$ is an independent set in ${H}_i$ for $1\leq i\leq m$. The cooperative chromatic number of a class $\mathcal{H}$ is the smallest number of hypergraphs from $\mathcal{H}$ that always possess a cooperative coloring. For the classes of $k$-uniform tight cycles, $k$-uniform loose cycles, $k$-uniform tight paths, and $k$-uniform loose paths, we find that their cooperative chromatic numbers are all exactly two utilizing a new proved set system partition theorem, which also has its independent interests and offers a broader perspective. For the class of $k$-partite $k$-uniform hypergraphs with sufficient large maximum degree $d$, we prove that its cooperative chromatic number has lower bound $Ω(\log_k d)$ and upper bound $\text{O}\left(\frac{d}{\ln d}\right)^{\frac{1}{k-1}}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_03727 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cooperative colorings of hypergraphs Bai, Xuqing Li, Bi Liu, Weichan Zhang, Xin Combinatorics Given a class $\mathcal{H}$ of $m$ hypergraphs ${H}_1, {H}_2, \ldots, {H}_m$ with the same vertex set $V$, a cooperative coloring of them is a partition $\{I_1, I_2, \ldots, I_m\}$ of $V$ in such a way that each $I_i$ is an independent set in ${H}_i$ for $1\leq i\leq m$. The cooperative chromatic number of a class $\mathcal{H}$ is the smallest number of hypergraphs from $\mathcal{H}$ that always possess a cooperative coloring. For the classes of $k$-uniform tight cycles, $k$-uniform loose cycles, $k$-uniform tight paths, and $k$-uniform loose paths, we find that their cooperative chromatic numbers are all exactly two utilizing a new proved set system partition theorem, which also has its independent interests and offers a broader perspective. For the class of $k$-partite $k$-uniform hypergraphs with sufficient large maximum degree $d$, we prove that its cooperative chromatic number has lower bound $Ω(\log_k d)$ and upper bound $\text{O}\left(\frac{d}{\ln d}\right)^{\frac{1}{k-1}}$. |
| title | Cooperative colorings of hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.03727 |