Maximum cuts and judicious partitions in graphs without short cycles

Journal of Combinatorial Theory. Series B

Volumn 88, Issue 2, 2003, Pages 329-346

  Alon, Noga ^a,b   Bollobás, Béla ^c,d   Krivelevich, Michael ^b   Sudakov, Benny ^a,e  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c University of Memphis   (United States)

^d TRINITY COLLEGE   (United Kingdom)

^e PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038011540     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00036-4     Document Type: Article

References (16)

1. N. Alon, Explicit Ramsey graphs and orthonormal labelings, Electronic J. Combin. 1 (1994) R12, 8pp.
2. N. Alon, Bipartite subgraphs, Combinatorica 16 (1996) 301-311.
3. N. Alon, E. Halperin, Bipartite subgraphs of integer weighted graphs, Discrete Math. 181 (1998) 19-29.
4. N. Alon, M. Krivelevich, B. Sudakov, Turán numbers of bipartite graphs and related Ramsey type questions, submitted for publication.
5. N. Alon, J. Spencer, The Probabilistic Method, 2nd Edition, Wiley, New York, 2000.
6. R.C. Baker, G. Harman, J. Pintz, The difference between consecutive primes II, Proc. London Math. Soc. 83 (2001) 532-562.
7. B. Bollobás, A.D. Scott, Exact bounds for judicious partitions of graphs, Combinatorica 19 (1999) 473-486.
8. B. Bollobás, A.D. Scott, Better bounds for max cut, in: B. Bollobás (Ed.), Contemporary Combinatorics, Bolyai Society Mathematical Studies, Springer, Berlin, 2002, pp. 185-246.
9. A. Bondy, M. Simonovits, Cycles of even length in graphs, J. Combin. Theory Ser. B 16 (1974) 97-105.
10. C.S. Edwards, Some extremal properties of bipartite subgraphs, Canad. J. Math. 3 (1973) 475-485.
11. C.S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, Proceedings of Second Czechoslovak Symposium on Graph Theory, Prague, 1975, pp. 167-181.
12. P. Erdos, Problems and results in graph theory and combinatorial analysis, in: Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977), Academic Press, New York, 1979, pp. 153-163.
13. P. Erdos, A. Rényi, On a problem in the theory of graphs (in Hungarian), Publ. Math. Inst. Hungar. Acad. Sci. 7 (1962) 215-235.
14. S. Poljak, Zs. Tuza, Bipartite subgraphs of triangle-free graphs, SIAM J. Discrete Math. 7 (1994) 307-313.
15. T.D. Porter, On a bottleneck bipartition conjecture of Erdos, Combinatorica 12 (1992) 317-321.
16. J. Shearer, A note on bipartite subgraphs of triangle-free graphs, Random Structures Algorithms 3 (1992) 223-226.