Yandong Bai

collaborators

7 papers

cs.CC2019

Safe sets in digraphs

Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita +1

A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component $M$ of $D - S$ , there exists a…

math.CO2018

Uniform sets in a family with restricted intersections

Yandong Bai, Binlong Li, Jiuqiang Liu +1

Let $F$ be a family of subsets of $[n] = {1, \dots, n}$ and let $L$ be a set of nonnegative integers. The family $F$ is \emph{ $L$ -intersecting} if $|F\cap F'|\in…

math.CO2018

A note on hypergraph colorings

Yandong Bai

Let $t ⩾ 2$ and $s ⩾ 1$ be two integers. Define a $(t, s)$ -coloring of a hypergraph to be a coloring of its vertices using $t$ colors such that each color appears on e…

math.CO2018

Connected $k$ -factors in bipartite graphs

Yandong Bai, Binlong Li

Let $k, l$ be two positive integers. An $S_{k, l}$ is a graph obtained from disjoint $K_{1, k}$ and $K_{1, l}$ by adding an edge between the $k$ -degree vertex in $K_{1, k}$ and the $l$ -…

math.CO2018

On the number of vertex-disjoint cycles in digraphs

Yandong Bai, Yannis Manoussakis

Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2 k - 1$ contains $k$ vertex-disjoint cycles. It is famous…

math.CO2018

Rainbow triangles in arc-colored tournaments

Wei Li, Shenggui Zhang, Yandong Bai +1

Let $T_{n}$ be an arc-colored tournament of order $n$ . The maximum monochromatic indegree $Δ^{- m o n} (T_{n})$ (resp. outdegree $Δ^{+ m o n} (T_{n})$ ) of $T_{n}$ is the maximum number of…

Safe sets in digraphs

Uniform sets in a family with restricted intersections

A note on hypergraph colorings

Connected k-factors in bipartite graphs

On the number of vertex-disjoint cycles in digraphs

Rainbow triangles in arc-colored tournaments

Connected $k$ -factors in bipartite graphs