A note on the stability number of an orthogonality graph
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 [Classical p...
Saved in:
Main Authors: | Klerk, Etienne de., Pasechnik, Dmitrii V. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/92189 http://hdl.handle.net/10220/6870 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Approximation of the stability number of a graph via copositive programming
by: Klerk, Etienne de., et al.
Published: (2011) -
On some locally 3-transposition graphs
by: Pasechnik, Dmitrii V.
Published: (2011) -
On equicut graphs
by: Deza, Michel., et al.
Published: (2011) -
Improved lower bounds on book crossing numbers of complete graphs
by: Salazar, G., et al.
Published: (2014) -
On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
by: Sotirov, R., et al.
Published: (2012)