The Grothendieck constant of random and pseudo-random graphs
type: Item
instance of: scholarly article
title: The Grothendieck constant of random and pseudo-random graphs
zbMATH Open document ID: 1151.90055
author: Noga Alon
author: Eli Berger
published in: Discrete Optimization
publication date: 2008-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5358793
zbMATH Keywords: Grothendieck constant of a graph
zbMATH Keywords: semidefinite programming
zbMATH Keywords: random graphs
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.06.004
OpenAlex ID: W1967047762
cites work: Explicit construction of linear sized tolerant networks
cites work: Quadratic forms on graphs
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: A proof of alon's second eigenvalue conjecture
cites work: Q3239535
cites work: The ellipsoid method and its consequences in combinatorial optimization
DOI: 10.1016/J.DISOPT.2006.06.004
Recommended article: An analogue of the Erdős-Gallai theorem for random graphs
Recommended article: Q3825110
Recommended article: Random graphs and the parity quantifier
Recommended article: Turán's theorem for pseudo-random graphs
Recommended article: Random graph-homomorphisms and logarithmic degree
Recommended article: Random graphons and a weak positivstellensatz for graphs
Recommended article: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Recommended article: The Lovász Number of Random Graphs
Recommended article: Random hypergraphs in pseudofinite fields
description: scientific article; zbMATH DE number 5358793