The following pages link to The sandwich theorem (Q1344393):
Displaying 18 items.
- Invariant Semidefinite Programs (Q2802527) (← links)
- Clique, chromatic, and Lovász numbers of certain circulant graphs (Q3439129) (← links)
- A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958) (← links)
- A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
- The problem of quantum correlations and the totalitarian principle (Q4993417) (← links)
- (Q5009505) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs (Q5026994) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- A Graph Theoretic Formula for the Number of Primes $\pi(n)$ (Q5148772) (← links)
- Resource convertibility and ordered commutative monoids (Q5360212) (← links)
- (Q5708497) (← links)
- (Q5743408) (← links)
- On Sidorenko's conjecture for determinants and Gaussian Markov random fields (Q6074867) (← links)
- Semidefinite programming and its applications to NP problems (Q6085755) (← links)
- Graph coloring and semidefinite rank (Q6589762) (← links)
