Výsledky vyhledávání - "Seo, Jaehyeon"

Report

Transversal cycles and paths in tournaments

Autor: Chakraborti, Debsoumya, Kim, Jaehoon, Lee, Hyunwoo, Seo, Jaehyeon

Thomason [$\textit{Trans. Amer. Math. Soc.}$ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except possibly the consistently oriented Hamilton cycle. This paper establi

Externí odkaz: http://arxiv.org/abs/2407.14300

Zobrazit plný text záznamu

Report

Hamilton transversals in tournaments

Autor: Chakraborti, Debsoumya, Kim, Jaehoon, Lee, Hyunwoo, Seo, Jaehyeon

It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizations of these classical results. For a collection $\mathbf{T}=\{T_1,\dot

Externí odkaz: http://arxiv.org/abs/2307.00912

Zobrazit plný text záznamu

Report

On a rainbow extremal problem for color-critical graphs

Autor: Chakraborti, Debsoumya, Kim, Jaehoon, Lee, Hyunwoo, Liu, Hong, Seo, Jaehyeon

There has been extensive studies on the following question: given $k$ graphs $G_1,\dots, G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a `colorful' copy of $H$, i.e., a copy of $H$ containing at most one edge from each $

Externí odkaz: http://arxiv.org/abs/2204.02575

Zobrazit plný text záznamu

Report

On 1-subdivisions of transitive tournaments

Autor: Kim, Jaehoon, Lee, Hyunwoo, Seo, Jaehyeon

Publikováno v: The Electronic Journal of Combinatorics 29(1) (2022), P1.51

The oriented Ramsey number $\vec{r}(H)$ for an acyclic digraph $H$ is the minimum integer $n$ such that any $n$-vertex tournament contains a copy of $H$ as a subgraph. We prove that the $1$-subdivision of the $k$-vertex transitive tournament $H_k$ sa

Externí odkaz: http://arxiv.org/abs/2110.05002

Zobrazit plný text záznamu