The following pages link to The sandwich theorem (Q1344393):
Displaying 50 items.
- Conic formulations of graph homomorphisms (Q295829) (← links)
- All normalized anti-monotonic overlap graph measures are bounded (Q408673) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture (Q867926) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- Eigenvalue interlacing and weight parameters of graphs (Q1300913) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Coloring the normalized Laplacian for oriented hypergraphs (Q1979369) (← links)
- Sandwich theorems and capacity bounds for non-commutative graphs (Q2005181) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- A unified construction of semiring-homomorphic graph invariants (Q2052822) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Information theoretic parameters of noncommutative graphs and convex corners (Q2152773) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- Duality of graph invariants (Q2193958) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- The minrank of random graphs over arbitrary fields (Q2303679) (← links)
- Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs (Q2332386) (← links)
- New lower bounds for the Shannon capacity of odd cycles (Q2364621) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
