共 50 条
On k-partite subgraphs
被引:0
|作者:
Hofmeister, T
[1
]
Lefmann, H
[1
]
机构:
[1] Univ Dortmund, D-44221 Dortmund, Germany
来源:
关键词:
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Initiated by a recent question of Erdos, we give lower bounds on the size of a largest k-partite subgraph of a graph. Also the corresponding problem for uniform hypergraphs is considered.
引用
收藏
页码:303 / 308
页数:6
相关论文