scientific article; zbMATH DE number 3634289
From MaRDI portal
zbMath0408.05031MaRDI QIDQ4194987
No author found.
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CapacityGraphCyclesPetersen GraphDodecahedral GraphsIcosahedral GraphsIndependent NumberLovasz BoundQuadratic Residue Graphs
Related Items
Capacities: From information theory to extremal set theory, Matrix Relaxations in Combinatorial Optimization, Tightening a copositive relaxation for standard quadratic optimization problems, Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone, Copositivity cuts for improving SDP bounds on the clique number, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Semidefinite programming relaxations for graph coloring and maximal clique problems, Strengthened semidefinite programming bounds for codes, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, On product of association schemes and Shannon capacity, A characterization of Delsarte's linear programming bound as a ratio bound, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Sabidussi versus Hedetniemi for three variations of the chromatic number, A recursive Lovász theta number for simplex-avoiding sets, A Sum of Squares Characterization of Perfect Graphs, Graph homomorphisms via vector colorings, Copositive optimization -- recent developments and applications, Spectral bounds for the independence ratio and the chromatic number of an operator, Chromatic Gallai identities operating on Lovász number, A new property of the Lovász number and duality relations between graph parameters, An axiomatic duality framework for the theta body and related convex corners, Quadratic factorization heuristics for copositive programming, Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, A limit theorem for the Shannon capacities of odd cycles I, A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming, Relaxations of Combinatorial Problems Via Association Schemes, Invariant Semidefinite Programs, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Lower bounds for measurable chromatic numbers, Improving upper bounds for the clique number by non-valid inequalities, Spectral characterizations of the Lovász number and the Delsarte number of a graph, Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming, On the Shannon capacity of a directed graph, Complete positivity and distance-avoiding sets
