A note on the stability number of an orthogonality graph

DOI10.1016/J.EJC.2006.08.011MaRDI QIDQ2643845zbMATH OpenOpenAlexDBLPWikidataFDO

Authors E. de Klerk, Dmitrii V. Pasechnik

Publication date 27 August 2007

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0505038, https://research.tilburguniversity.edu/en/publications/fb61fc0a-a843-4a66-8a69-36663e1032f5

zbMATH Keywords

stability numberDelsarte boundorthogonality graph

Mathematics Subject Classification ID

Semidefinite programming (90C22) Extremal problems in graph theory (05C35)

Abstract: We consider the orthogonality graph Omega(n) with 2^n vertices corresponding to the 0-1 n-vectors, two vertices adjacent if and only if the Hamming distance between them is n/2. We show that the stability number of Omega(16) is alpha(Omega(16))= 2304, thus proving a conjecture by Galliard. The main tool we employ is a recent semidefinite programming relaxation for minimal distance binary codes due to Schrijver. As well, 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 Omega(n) the latter two bounds are equal to 2^n/n.

Recommendations

• Lower bounds on the stability number of graphs computed in terms of degrees
• Sharp bounds on the order, size, and stability number of graphs
• Improving an upper bound on the stability number of a graph
• LP-oriented upper bounds for the weighted stability number of a graph
• A characterization of Delsarte's linear programming bound as a ratio bound

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• A comparison of the Delsarte and Lovász bounds
• Forbidden Intersections
• Global optimization with polynomials and the problem of moments
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Reduction of symmetric semidefinite programs using the regular -representation
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(12)

• Problems from CGCS Luminy, May 2007
• A characterization of Delsarte's linear programming bound as a ratio bound
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• Strengthened semidefinite programming bounds for codes
• The automorphism group and fixing number of orthogonality graph over a vector space
• The density of sets avoiding distance 1 in Euclidean space
• High dimensional Hoffman bound and applications in extremal combinatorics
• Block-diagonal semidefinite programming hierarchies for 0/1 programming
• Invitation to intersection problems for finite sets
• Commutative association schemes
• Deterministic quantum non-locality and graph colorings
• Invariant Semidefinite Programs

Describes a project that uses

Uses Software

• SeDuMi

This page was built for publication: A note on the stability number of an orthogonality graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643845)