Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Bozyk P"'
The $t$-onion star is the digraph obtained from a star with $2t$ leaves by replacing every edge by a triple of arcs, where in $t$ triples we orient two arcs away from the center, and in the remaining $t$ triples we orient two arcs towards the center.
Externí odkaz:
http://arxiv.org/abs/2211.15477
Autor:
Bożyk, Łukasz, Pilipczuk, Michał
For a fixed simple digraph $H$ without isolated vertices, we consider the problem of deleting arcs from a given tournament to get a digraph which does not contain $H$ as an immersion. We prove that for every $H$, this problem admits a polynomial kern
Externí odkaz:
http://arxiv.org/abs/2208.07789
Autor:
Bonamy, Marthe, Bożyk, Łukasz, Grzesik, Andrzej, Hatzel, Meike, Masařík, Tomáš, Novotná, Jana, Okrasa, Karolina
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1, Graph Theory (August 14, 2022) dmtcs:7660
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:
http://arxiv.org/abs/2105.09871
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:
http://arxiv.org/abs/2103.14667
Autor:
Bożyk, Łukasz, Pilipczuk, Michał
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1, Graph Theory (April 5, 2022) dmtcs:7099
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-di
Externí odkaz:
http://arxiv.org/abs/2101.06732
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:
http://arxiv.org/abs/2010.11664
A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines $l_1$ and $l_2$, one on each. A bipartite permutation graph is a permutation graph which is bipartite. In this paper we study the parame
Externí odkaz:
http://arxiv.org/abs/2010.11440
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bentley J Kelley, Popova Antonia P, Bozyk Paul D, Linn Marisa J, Baek Amy E, Lei Jing, Goldsmith Adam M, Hershenson Marc B
Publikováno v:
Respiratory Research, Vol 11, Iss 1, p 127 (2010)
Abstract Background Recent studies have indicated the presence of multipotent mesenchymal stromal cells (MSCs) in human lung diseases. Excess airway smooth muscle, myofibroblasts and activated fibroblasts have each been noted in asthma, suggesting th
Externí odkaz:
https://doaj.org/article/f58a7e314cf3414396c2a59280885710
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.