Bipartite subgraphs of integer weighted graphs

Discrete Mathematics

Volumn 181, Issue 1-3, 1998, Pages 19-29

  Alon, Noga ^a   Halperin, Eran ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038369163     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00041-1     Document Type: Article

References (5)

1. N. Alon, Bipartite subgraphs, Combinatorica 16 (1996) 301-311.
2. C.S. Edwards, Some extremal properties of bipartite subgraphs, Canadian J. Math. 3 (1973) 475-485.
3. C.S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, Proc. 2nd Czechoslovak Symposium on Graph Theory, Prague, 1975, pp. 167-181.
4. P. Erdos, A. Gyárfás, Y. Kohayakawa, The size of the largest bipartite subgraph, Discrete Math., to appear.
5. S. Poljak, Zs. Tuza, The max cut problem - a survey, in: W. Cook, L. Lovász, P.D. Seymour (Eds.), DIMACS Series in Discrete Mathematics, AMS Press, Providence, RI, to appear.