Szczegóły publikacji
Opis bibliograficzny
Directed graphs without rainbow triangles / Sebastian Babiński, Andrzej Grzesik, Magdalena PROROK // W: EUROCOMB'23 [Dokument elektroniczny] : European conference on Combinatorics, Graph Theory and Applications : Prague, Czech Republic, August 28–September 1, 2023. — Wersja do Windows. — Dane tekstowe. — [Prague] : European Conference on Combinatorics, Graph Theory and Applications, [2023]. — (European Conference on Combinatorics, Graph Theory and Applications ; ISSN 2788-3116). — S. 88–93. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://journals.muni.cz/eurocomb/article/view/35546/31419 [2024-01-22]. — Bibliogr. s. 93, Abstr.
Autorzy (3)
- Babiński Sebastian
- Grzesik Andrzej
- AGHProrok Magdalena
Dane bibliometryczne
| ID BaDAP | 151572 |
|---|---|
| Data dodania do BaDAP | 2024-01-31 |
| DOI | 10.5817/CZ.MUNI.EUROCOMB23-012 |
| Rok publikacji | 2023 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Creative Commons | |
| Konferencja | EuroConference on Combinatorics, Graph Theory and Applications 2023 |
| Czasopismo/seria | European Conference on Combinatorics, Graph Theory and Applications |
Abstract
One of the most fundamental questions in graph theory is Mantel’s theorem whichdetermines the maximum number of edges in a triangle-free graph of a given order.Recently a colorful variant of this problem has been solved. In such a variant weconsidercgraphs on a common vertex set, thinking of each graph as edges in a dis-tinct color, and want to determine the smallest number of edges in each color which guarantees the existence of a rainbow triangle. Here, we solve the analogous problemfor directed graphs without rainbow triangles, either directed or transitive, for anynumber of colors. The constructions and proofs essentially differ forc=3andc≥4and the type of the forbidden triangle.
