科学研究
学术报告
当前位置: 学院主页 > 科学研究 > 学术报告 > 正文

Vertex-disjoint cycles in bipartite graphs with partial degree

发布时间:2019-03-28 作者: 浏览次数:
Speaker: 江素云 DateTime: 2019年3月30日(周六)上午10:00-11:00
Brief Introduction to Speaker:

江素云,江汉大学交叉学科研究院博士。

Place: 六号楼二楼报告厅
Abstract:Let $G$ be a graph of order $n\geq 3$ and $W$ be a subset of $V(G)$ with $|W|\geq 3k$. Hong Wang conjectured that if $d(x)\geq 2n/3$ for each $x\in W$ then for any integer partition $|W|=n_1+\cdots +n_k$ with $n_i\geq 3$, $G$ contains $k$ vertex-disjoint cycles $C_1,\ldots, C_k$ such that $|V(C_i)\cap W|=n_i$ for all $1\leq i\leq k$. We investigated the bipartite version of this conjecture and gave a partial degree condition to guarantee the existence of $k$ vertex-disjoint cycles in bipartite graphs.