scientific article; zbMATH DE number 3634289
From MaRDI portal
Publication:4194987
Cited in
(39)- Lower bounds for measurable chromatic numbers
- On the Shannon capacity of a directed graph
- Capacities: From information theory to extremal set theory
- Spectral characterizations of the Lovász number and the Delsarte number of a graph
- Sabidussi versus Hedetniemi for three variations of the chromatic number
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- On product of association schemes and Shannon capacity
- Complete positivity and distance-avoiding sets
- Improving upper bounds for the clique number by non-valid inequalities
- Tightening a copositive relaxation for standard quadratic optimization problems
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Graph homomorphisms via vector colorings
- Chromatic Gallai identities operating on Lovász number
- Copositivity cuts for improving SDP bounds on the clique number
- 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
- Matrix relaxations in combinatorial optimization
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Copositive optimization -- recent developments and applications
- A limit theorem for the Shannon capacities of odd cycles I
- Spectral bounds for the independence ratio and the chromatic number of an operator
- Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- A recursive Lovász theta number for simplex-avoiding sets
- 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
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- Quadratic factorization heuristics for copositive programming
- A Sum of Squares Characterization of Perfect Graphs
- A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem
- Hoffman colorability of (strongly) regular graphs
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- On the ratio of Shannon numbers of graphs
- Tightness of a MaxCut lower bound via vector chromatic number
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Strengthened semidefinite programming bounds for codes
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4194987)
