Abstract
We study the Lovász number θ along with two further SDP relaxations θ1/2, θ2 of the independence number and the corresponding relaxations θ̄, θ̄1/2, θ̄2 of the chromatic number on random graphs Gn,p. We prove that θ̄, θ̄1/2, θ̄2(Gn,p) in the case p
Cite
CITATION STYLE
APA
Coja-Oghlan, A. (2003). The Lovász number of random graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2764, 228–239. https://doi.org/10.1007/978-3-540-45198-3_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free