### Abstract

The Grothendieck constant of a graph G = (V, E) is the least constant K such that for every matrix A : V × V → R, under(max, f : V → S^{| V}

Original language | English (US) |
---|---|

Pages (from-to) | 323-327 |

Number of pages | 5 |

Journal | Discrete Optimization |

Volume | 5 |

Issue number | 2 |

DOIs | |

State | Published - May 1 2008 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computational Theory and Mathematics
- Applied Mathematics

### Keywords

- Grothendieck constant of a graph
- Random graphs
- Semidefinite programming

## Fingerprint Dive into the research topics of 'The Grothendieck constant of random and pseudo-random graphs'. Together they form a unique fingerprint.

## Cite this

Alon, N., & Berger, E. (2008). The Grothendieck constant of random and pseudo-random graphs.

*Discrete Optimization*,*5*(2), 323-327. https://doi.org/10.1016/j.disopt.2006.06.004