Algebras, graphs and thetas

DOI10.1016/j.entcs.2019.08.025OpenAlexW2978897830WikidataQ113317407 ScholiaQ113317407MaRDI QIDQ2132354

Marcel Kenji De Carli Silva, David E. Roberson, Gabriel Coutinho, Chris D. Godsil

Publication date: 27 April 2022

Full work available at URL: https://arxiv.org/abs/1910.06260

zbMATH Keywords

coherent configurationLovász theta functionmatrix \(\ast\)-algebraclique-coclique inequality

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Conic formulations of graph homomorphisms
• Handbook on semidefinite, conic and polynomial optimization
• Copositive programming motivated bounds on the stability and the chromatic numbers
• Bounds on subsets of coherent configurations
• Coherent configurations. I: Ordinary representation theory
• Tightness in subset bounds for coherent configurations
• Invariant Semidefinite Programs
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• The Operator $\Psi$ for the Chromatic Number of a Graph
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebras, graphs and thetas