Abstract
Let MaxCut(G) be the value of the maximum cut of a graph G. Let f(x, n) be the expectation of MaxCut(G)/xn for random graphs with n vertices and xn edges and let r(x,n) be the expectation of MaxCut(G)/xn for random 2x-regular graphs with n vertices. We prove, for sufficiently large x:
Preview
Unable to display preview. Download preview PDF.
References
Francisco Barahona, M. Jünger, M. Grötschel, and G. Reinelt. An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research, (36):493–513, 1988.
Joel Friedman. On the second eigenvalue and random walks in random d-regular graphs. Combinatorica, 11(4):331–365, 1991.
Michel X. Goemans and David P. Williamson..878-approximation algorithms for MAX CUT and MAX 2SAT. In Proceedings of the 26th ACM Symposium on the Theory of Computation, 1994.
F. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing, 4(3):221–225, September 1975.
Arun Jagota. Approximating maximum clique with a Hopfield network. IEEE Transactions on Neural Networks, 6(3):724–735, May 1995.
Richard M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103, New York, 1972. Plenum Press.
J. Komlos and R. Paturi. Effect of conectivity in associative memory models. Technical Report CS88-131, University of California. San Diego, August 1988.
Sartaj Sahni and Teofilo Gonzalez. P-Complete Approximation Problems. Journal of the ACM, 23(3):555–565, July 1976.
Johan Håstad. Some optimal in-approximability results. November 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoni, A., Campadelli, P., Posenato, R. (1997). An upper bound for the maximum cut mean value. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024489
Download citation
DOI: https://doi.org/10.1007/BFb0024489
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63757-8
Online ISBN: 978-3-540-69643-8
eBook Packages: Springer Book Archive