Zobrazeno 1 - 10
of 1 934
pro vyhledávání: '"Cheng, Yangyang"'
Given a collection $\mathcal{G} =\{G_1,G_2,\dots,G_m\}$ of graphs on the common vertex set $V$ of size $n$, an $m$-edge graph $H$ on the same vertex set $V$ is transversal in $\mathcal{G}$ if there exists a bijection $\varphi :E(H)\rightarrow [m]$ su
Externí odkaz:
http://arxiv.org/abs/2406.13998
Autor:
Cheng, Yangyang, Staden, Katherine
Given graphs $G_1,\ldots,G_s$ all on a common vertex set and a graph $H$ with $e(H) = s$, a copy of $H$ is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G_i$. We establish a stability result for transversal Hamilton cycles:
Externí odkaz:
http://arxiv.org/abs/2403.09913
Autor:
Cheng, Yangyang, Keevash, Peter
Thomass\'{e} conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree $\delta$ and girth $g$ contains a directed path of length $\delta(g-1)$. Bai and Manoussakis gave counterexample
Externí odkaz:
http://arxiv.org/abs/2402.16776
Given any digraph $D$, let $\mathcal{P}(D)$ be the family of all directed paths in $D$, and let $H$ be a digraph with the arc set $A(H)=\{a_1, \ldots, a_k\}$. The digraph $D$ is called arbitrary Hamiltonian $H$-linked if for any injective mapping $f:
Externí odkaz:
http://arxiv.org/abs/2401.17475
Autor:
Cheng, Yangyang, Staden, Katherine
Given graphs $G_1,\ldots,G_s$ all on the same vertex set and a graph $H$ with $e(H) \leq s$, a copy of $H$ is transversal or rainbow if it contains at most one edge from each $G_c$. When $s=e(H)$, such a copy contains exactly one edge from each $G_i$
Externí odkaz:
http://arxiv.org/abs/2306.03595
A $k$-graph system $\textbf{H}=\{H_i\}_{i\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\textbf{H}$-transversal provided that there exists an injection $\varphi: E(
Externí odkaz:
http://arxiv.org/abs/2111.07079
Publikováno v:
In Nutrition, Metabolism and Cardiovascular Diseases July 2024 34(7):1696-1702
Autor:
Sui, Mengjun, Wang, Simeng, Zhou, Ye, Dang, Hui, Zeng, Zekun, Gu, Kunrong, Cao, Hongxin, Ji, Meiju, Dai, Penggao, Cheng, Yangyang, Hou, Peng
Publikováno v:
In Chemical Engineering Journal 15 August 2024 494
We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host graph. For a collection $\textbf{G}=\{G_1, G_2,\ldots, G_{m}\}$ of no
Externí odkaz:
http://arxiv.org/abs/2105.10219