3 citations · 6 across the 15 of their papers we have counts for
6 papers · 1 filter
Uniform sets in a family with restricted intersections
Yandong Bai, Binlong Li, Jiuqiang Liu +1
Let be a family of subsets of and let be a set of nonnegative integers. The family is \emph{-intersecting} if $|F\cap F'|\in…
A note on hypergraph colorings
Yandong Bai
Let and be two integers. Define a -coloring of a hypergraph to be a coloring of its vertices using colors such that each color appears on e…
Connected -factors in bipartite graphs
Yandong Bai, Binlong Li
Let be two positive integers. An is a graph obtained from disjoint and by adding an edge between the -degree vertex in and the -…
On the number of vertex-disjoint cycles in digraphs
Yandong Bai, Yannis Manoussakis
Let be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least contains vertex-disjoint cycles. It is famous…
Rainbow triangles in arc-colored tournaments
Wei Li, Shenggui Zhang, Yandong Bai +1
Let be an arc-colored tournament of order . The maximum monochromatic indegree (resp. outdegree ) of is the maximum number of…
Kernels by rainbow paths in arc-colored tournaments
Yandong Bai, Binlong Li, Shenggui Zhang
For an arc-colored digraph , define its {\em kernel by rainbow paths} to be a set of vertices such that (i) no two vertices of are connected by a rainbow path in , an…