The Lovász Number of Random Graphs
From MaRDI portal
Publication:5696358
DOI10.1017/S0963548305006826zbMath1076.05072arXivmath/0306266MaRDI QIDQ5696358
Publication date: 18 October 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0306266
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
An improved algorithm for approximating the chromatic number of \(G_{n,p}\) ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ Unnamed Item ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime ⋮ The theta number of simplicial complexes
This page was built for publication: The Lovász Number of Random Graphs
