Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Łukasz Bożyk"'
Autor:
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average degree, inclu
Externí odkaz:
https://doaj.org/article/b9d6277e33dc42659da823f7cc2d8440
Autor:
Łukasz Bożyk, Michał Pilipczuk
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
We consider the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments. We prove that for every simple digraph $H$, $k\in \mathbb{N}$, and tournament $T$, the following statements hold: (i) If in $T$ one cannot find $k$ arc-d
Externí odkaz:
https://doaj.org/article/e699773842fb4b5e98ed8842864d69ac
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper bounds for a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bfa170124e0f1b5f03815af6fd40ec7
https://ruj.uj.edu.pl/xmlui/handle/item/289621
https://ruj.uj.edu.pl/xmlui/handle/item/289621
Publikováno v:
Journal of Combinatorial Theory, Series B
Journal of Combinatorial Theory, Series B, In press, ⟨10.1016/j.jctb.2022.07.009⟩
Journal of Combinatorial Theory, Series B, In press, ⟨10.1016/j.jctb.2022.07.009⟩
Tree-cut width is a graph parameter introduced by Wollan that is an analogue of treewidth for the immersion order on graphs in the following sense: the tree-cut width of a graph is functionally equivalent to the largest size of a wall that can be fou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e184044aeba9985914a8faad093509af
Autor:
Karolina Okrasa, Marthe Bonamy, Jana Novotná, Tomáš Masařík, Meike Hatzel, Łukasz Bożyk, Andrzej Grzesik
Publikováno v:
Trends in Mathematics
Trends in Mathematics-Extended Abstracts EuroComb 2021
Extended Abstracts EuroComb 2021-European Conference on Combinatorics, Graph Theory and Applications
Trends in Mathematics ISBN: 9783030838225
Trends in Mathematics-Extended Abstracts EuroComb 2021
Extended Abstracts EuroComb 2021-European Conference on Combinatorics, Graph Theory and Applications
Trends in Mathematics ISBN: 9783030838225
Tuza famously conjectured in 1981 that in a graph without \(k+1\) edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average degree, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::876c922dfe236f8bff3d8573103bacbf