Restricted subgraphs of edge-colored graphs and applications
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910751461998592 |
|---|---|
| author | Sudakov, Benny |
| author_facet | Sudakov, Benny |
| contents | A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding rainbow subgraphs or other restricted structures in edge-colored graphs has a long history, dating back to Euler's work on Latin squares. It has also proven to be a powerful method for studying several well-known questions in other areas.
In this survey, we will provide a brief introduction to this topic, discuss several results in this area, and demonstrate their applications to problems in graph decomposition, additive combinatorics, theoretical computer science, and coding theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_13945 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Restricted subgraphs of edge-colored graphs and applications Sudakov, Benny Combinatorics Discrete Mathematics A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding rainbow subgraphs or other restricted structures in edge-colored graphs has a long history, dating back to Euler's work on Latin squares. It has also proven to be a powerful method for studying several well-known questions in other areas. In this survey, we will provide a brief introduction to this topic, discuss several results in this area, and demonstrate their applications to problems in graph decomposition, additive combinatorics, theoretical computer science, and coding theory. |
| title | Restricted subgraphs of edge-colored graphs and applications |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2412.13945 |