A note on the stability number of an orthogonality graph

DOI10.1016/j.ejc.2006.08.011zbMath1125.05053arXivmath/0505038OpenAlexW1968116383WikidataQ56859927 ScholiaQ56859927MaRDI QIDQ2643845

Dimitrii V. Pasechnik, Etienne de Klerk

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

zbMATH Keywords

stability numberDelsarte boundorthogonality graph

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• SeDuMi

Cites Work

• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Global Optimization with Polynomials and the Problem of Moments
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Forbidden Intersections
• A comparison of the Delsarte and Lovász bounds
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item