### Abstract

We consider the orthogonality graph (n) with 2n vertices corresponding to the vectors {0, 1}n, two vertices adjacent if and only if the Hamming distance between them is n/2.We show that, for n = 16, the stability number of (n) is ( (16)) = 2304, thus proving a conjecture by Galliard [7].The main tool we employ is a recent semidefinite programming relaxation for minimal distance binary codes due to Schrijver [16].Moreover, we give a general condition for Delsarte bound on the (co)cliques in graphs of relations of association schemes to coincide with the ratio bound, and use it to show that for (n) the latter two bounds are equal to 2n/n.

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 11 |

Volume | 2005-66 |

Publication status | Published - 2005 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2005-66 |

### Keywords

- C0
- C61

## Fingerprint Dive into the research topics of 'A Note on the Stability Number of an Orthogonality Graph'. Together they form a unique fingerprint.

## Cite this

de Klerk, E., & Pasechnik, D. V. (2005).

*A Note on the Stability Number of an Orthogonality Graph*. (CentER Discussion Paper; Vol. 2005-66). Operations research.