当前位置: 首页 / 科研学术 / 学术预告 / 正文

Vertex-disjoint cycles in bipartite graphs with partial degree

作者:   时间:2019-04-23   点击数:

题目:Vertex-disjoint cycles in bipartite graphs with partial degree


主讲人:江素云


摘要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.


主讲人简介:江素云,江汉大学交叉学科研究院助理研究员


邀请人:王光辉  数学学院教授


时间:201942410:00


地点:中心校区知新楼B924报告厅

地址:中国山东省济南市山大南路27号   邮编:250100  

电话:0531-88364652  院长信箱:sxyuanzhang@sdu.edu.cn

Copyright@山东大学数学学院

微信公众号