Directed graphs without rainbow stars
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_ | 1866913220838555648 |
|---|---|
| author | Gerbner, Daniel Grzesik, Andrzej Palmer, Cory Prorok, Magdalena |
| author_facet | Gerbner, Daniel Grzesik, Andrzej Palmer, Cory Prorok, Magdalena |
| contents | In a rainbow version of the classical Turán problem one considers multiple graphs on a common vertex set, thinking of each graph as edges in a distinct color, and wants to determine the minimum number of edges in each color which guarantees existence of a rainbow copy (having at most one edge from each graph) of a given graph. Here, we prove an optimal solution for this problem for any directed star and any number of colors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_01028 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Directed graphs without rainbow stars Gerbner, Daniel Grzesik, Andrzej Palmer, Cory Prorok, Magdalena Combinatorics 05C20, 05C35 In a rainbow version of the classical Turán problem one considers multiple graphs on a common vertex set, thinking of each graph as edges in a distinct color, and wants to determine the minimum number of edges in each color which guarantees existence of a rainbow copy (having at most one edge from each graph) of a given graph. Here, we prove an optimal solution for this problem for any directed star and any number of colors. |
| title | Directed graphs without rainbow stars |
| topic | Combinatorics 05C20, 05C35 |
| url | https://arxiv.org/abs/2402.01028 |