The size of the largest bipartite subgraphs

被引:27
作者
Erdos, P
Gyarfas, A
Kohayakawa, Y
机构
[1] HUNGARIAN ACAD SCI,INST MATH,H-1364 BUDAPEST,HUNGARY
[2] HUNGARIAN ACAD SCI,INST COMP & AUTOMAT,H-1111 BUDAPEST,HUNGARY
[3] UNIV SAO PAULO,INST MATEMAT & ESTAT,BR-05508900 SAO PAULO,BRAZIL
基金
巴西圣保罗研究基金会; 匈牙利科学研究基金会;
关键词
D O I
10.1016/S0012-365X(97)00004-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Simple proofs are given for results of Edwards concerning the size of the largest bipartite subgraphs of a graph. (C) 1997 Elsevier Science B.V.
引用
收藏
页码:267 / 271
页数:5
相关论文
共 6 条
[1]  
ALON N, 1995, IN PRESS BIPARTITE S
[2]  
EDWARDS CS, 1973, CAN J MATH, V25, P475, DOI 10.4153/CJM-1973-048-x
[3]   ON SOME EXTREMAL PROBLEMS IN GRAPH THEORY [J].
ERDOS, P .
ISRAEL JOURNAL OF MATHEMATICS, 1965, 3 (02) :113-&
[4]  
Erdos P., 1968, J. of Combinatorial Theory, V5, P164, DOI DOI 10.1016/S0021-9800(68)80051-1.
[5]  
HOFMEISTER T, 1995, IN PRESS K PARTITE S
[6]  
[No title captured]