@techreport{8fc31de593ae4966836af2598a425033,

title = "A Note on the Stability Number of an Orthogonality Graph",

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.",

keywords = "C0, C61",

author = "{de Klerk}, E. and D.V. Pasechnik",

note = "Subsequently published in the European Journal of Combinatorics, 2007 Pagination: 11",

year = "2005",

language = "English",

volume = "2005-66",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}