Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-12-03T19:11:52.724Z Has data issue: false hasContentIssue false
  • English
  • Français

Bipartite Subgraphs and the Smallest Eigenvalue

Published online by Cambridge University Press:  01 January 2000

NOGA ALON  and
BENNY SUDAKOV
NOGA ALON
Affiliation:
Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Institute for Advanced Study, Princeton, NJ 08540, USA (e-mail: [email protected])
BENNY SUDAKOV
Affiliation:
Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Two results dealing with the relation between the smallest eigenvalue of a graph and its bipartite subgraphs are obtained. The first result is that the smallest eigenvalue μ of any non-bipartite graph on n vertices with diameter D and maximum degree Δ satisfies μ [ges ] −Δ + 1/(D+1)n. This improves previous estimates and is tight up to a constant factor. The second result is the determination of the precise approximation guarantee of the MAX CUT algorithm of Goemans and Williamson for graphs G = (V, E) in which the size of the max cut is at least A[mid ]E[mid ], for all A between 0.845 and 1. This extends a result of Karloff.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 9 , Issue 1 , January 2000 , pp. 1 - 12
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)