期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A bound on judicious bipartitions of directed graphs
1
作者 Jianfeng Hou huawen ma +1 位作者 Xingxing Yu Xia Zhang 《Science China Mathematics》 SCIE CSCD 2020年第2期297-308,共12页
Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously,which have received much attention lately.Scott(2005)asked the following natural question:What is the maximum c... Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously,which have received much attention lately.Scott(2005)asked the following natural question:What is the maximum constant cdsuch that every directed graph D with m arcs and minimum outdegree d admits a bipartition V(D)=V_1∪V_2 satisfying min{e(V_1,V_2),e(V_2,V_1)}cdm?Here,for i=1,2,e(V_i,V_(3-i))denotes the number of arcs in D from V_i to V_(3-i).Lee et al.(2016)conjectured that every directed graph D with m arcs and minimum outdegree at least d 2 admits a bipartition V(D)=V_1∪V_2 such that min{e(V_1,V_2),e(V_2,V_1)}≥((d-1)/(2(2 d-1))+o(1))m.In this paper,we show that this conjecture holds under the additional natural condition that the minimum indegree is also at least d. 展开更多
关键词 directed graph PARTITION outdegree indegree tight component
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部