The Grothendieck constant of random and pseudo-random graphs

DOI10.1016/j.disopt.2006.06.004zbMath1151.90055OpenAlexW1967047762MaRDI QIDQ951106

Noga Alon, Eli Berger

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.06.004

zbMATH Keywords

semidefinite programmingrandom graphsGrothendieck constant of a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22)

Related Items

Grothendieck-Type Inequalities in Combinatorial Optimization, Grothendieck’s Theorem, past and present, Grothendieck constant is norm of Strassen matrix multiplication tensor

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit construction of linear sized tolerant networks
• The ellipsoid method and its consequences in combinatorial optimization
• A proof of alon's second eigenvalue conjecture
• Quadratic forms on graphs