Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming

P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compos. Math

1935

Earlier work this paper cites.

T. Kővári, V. T. Sós and P. Turán. On a problem of K. Zarankiewicz, Colloquium Math., 3

1954

Earlier work this paper cites.

P. Erdős, On even subgraphs of graphs, Mat. Lapok

1967

Earlier work this paper cites.

C.S. Edwards, Some extremal properties of bipartite subgraphs, Canad. J. Math

1973

Earlier work this paper cites.

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) 167–181

1975

Earlier work this paper cites.

P. Erdős, Problems and results in graph theory and combinatorial analysis, Proc. Fifth British Comb. Conf

1975

Earlier work this paper cites.

B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of combinatorics

1980

Earlier work this paper cites.

P. Erdős, R. Faudree, J. Pach, and J. Spencer, How to make a graph bipartite, J. Combin.Theory Ser. B

1988

Cited alongside, same era.

P. Erdős, E. Győri, and M. Simonovits, How many edges should be deleted to make a triangle-free graph bipartite? Sets, graphs and numbers (Budapest, 1991), 239–263, Colloq. Math. Soc. János Bolyai

1992

Cited alongside, same era.

J. Shearer, A note on bipartite subgraphs of triangle-free graphs, Rand. Struct. Alg

1992

Cited alongside, same era.

S. Poljak and Zs. Tuza, Bipartite subgraphs of triangle-free graphs, SIAM J. Discrete Math

1994

Cited alongside, same era.

M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM,

1995

Cited alongside, same era.

B. Bollobás and A. D. Scott, Better bounds for max cut, in: Contemporary Combinatorics

2002

Later among the works it cites.

N. Alon, B. Bollobás, M. Krivelevich, and B. Sudakov, Maximum cuts and judicious partitions in graphs without short cycles, J. Combin. Theory, Ser. B,

2003

Later among the works it cites.

N. Alon, M. Krivelevich, and B. Sudakov, Max Cut in H H -Free Graphs, Combin. Prob. and Computing

2005

Later among the works it cites.

B. Sudakov, Making a K 4 K_{4} -free graph bipartite, Combinatorica

2007

Later among the works it cites.

R. O’Donnell and Y. Wu, An optimal SDP algorithm for Max-Cut, and equally optimal long code tests, Proc. 40th ACM S. Theory Comput. (2008), 335–344

2008

Later among the works it cites.