Conic formulations of graph homomorphisms
From MaRDI portal
Publication:295829
DOI10.1007/s10801-016-0665-yzbMath1339.05401arXiv1411.6723OpenAlexW1674246975MaRDI QIDQ295829
Publication date: 13 June 2016
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6723
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (10)
Algebras, graphs and thetas ⋮ Matrices with high completely positive semidefinite rank ⋮ A compositional approach to quantum functions ⋮ Graph isomorphism: physical resources, optimization models, and algebraic characterizations ⋮ Correlation matrices, Clifford algebras, and completely positive semidefinite rank ⋮ Positively factorizable maps ⋮ Linear conic formulations for two-party correlations and values of nonlocal games ⋮ Completely positive semidefinite rank ⋮ Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming ⋮ Quantum homomorphisms
Cites Work
- Unnamed Item
- Copositive programming motivated bounds on the stability and the chromatic numbers
- On the quantum chromatic number of a graph
- The sandwich theorem
- Approximation of the Stability Number of a Graph via Copositive Programming
- Graph Homomorphisms for Quantum Players
- Multiparty Zero-Error Classical Channel Coding With Entanglement
- Entanglement-Assisted Zero-Error Source-Channel Coding
- Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
- Zero-Error Source–Channel Coding With Side Information
- Forbidden Intersections
- On the Shannon capacity of a graph
- Chains of dog-ears for completely positive matrices
This page was built for publication: Conic formulations of graph homomorphisms
