On the Shannon capacity of a graph

Cited In (only showing first 100 items - show all)

Convex Relaxations and Integrality Gaps
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
Quantum graph homomorphisms via operator systems
Quantum homomorphisms
Conic formulations of graph homomorphisms
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
Matrix convex hulls of free semialgebraic sets
The maximum clique problem
Polytopes of minimum positive semidefinite rank
On the independence number of some strong products of cycle-powers
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
A characterization of Delsarte's linear programming bound as a ratio bound
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
On the independence numbers of the cubes of odd cycles
An orthogonal basis for functions over a slice of the Boolean hypercube
Title not available (Why is that?)
Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
Semidefinite representations for finite varieties
Exponential lower bounds for polytopes in combinatorial optimization
A domain monotonicity theorem for graphs and Hamiltonicity
On the isoperimetric spectrum of graphs and its approximations
Exploiting special structure in semidefinite programming: a survey of theory and applications
Quadratic forms on graphs
The ellipsoid method and its consequences in combinatorial optimization
Graph Kernels: A Survey
A boundary point method to solve semidefinite programs
Laplacian matrices of graphs: A survey
Stable sets and polynomials
High-accuracy solution of large-scale semidefinite programs
New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
Copositive optimization -- recent developments and applications
Randomly colouring graphs (a combinatorial view)
Interlacing eigenvalues and graphs
The \(k\)-regular induced subgraph problem
Control and estimation under information constraints: toward a unified theory of control, computation and communications
New heuristics for the vertex coloring problem based on semidefinite programming
The exact bound in the Erdős-Ko-Rado theorem
The geometry of graphs and some of its algorithmic applications
Laplace eigenvalues of graphs---a survey
The sheaf-theoretic structure of non-locality and contextuality
Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
Chance constrained \(0-1\) quadratic programs using copulas
Copositive programming motivated bounds on the stability and the chromatic numbers
Strengthened semidefinite programming bounds for codes
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
Classical, quantum and nonsignalling resources in bipartite games
Improved lower bound on the Shannon capacity of \(C_7\)
Semidefinite programming relaxations for graph coloring and maximal clique problems
A simple removal lemma for large nearly-intersecting families
An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
Stochastic nuclear outages semidefinite relaxations
The density of sets avoiding distance 1 in Euclidean space
\(L(2,1)\)-labeling of strong products of cycles
On the copositive representation of binary and continuous nonconvex quadratic programs
Motivations and history of some of my conjectures
Maximum \(k\)-regular induced subgraphs
Generating cutting planes for the semidefinite relaxation of quadratic programs
A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
Matchings and covers in hypergraphs
Laplacian eigenvalues and partition problems in hypergraphs
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
The minimum rank of symmetric matrices described by a graph: a survey
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
On the theta number of powers of cycle graphs
A nonmonotone GRASP
A combinatorial approach to nonlocality and contextuality
Modified \(r\)-algorithm to find the global minimum of polynomial functions
On the measure of intersecting families, uniqueness and stability
Strong lift-and-project cutting planes for the stable set problem
Completely positive reformulations for polynomial optimization
Local chromatic number and Sperner capacity
Cutting planes in integer and mixed integer programming
Copositivity cuts for improving SDP bounds on the clique number
Dot product representations of graphs
A projected gradient algorithm for solving the maxcut SDP relaxation
Some Erdös–Ko–Rado Theorems for Chevalley Groups
Lower bounds for measurable chromatic numbers
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
On the ultimate independence ratio of a graph
Diversification strategies in tabu search algorithms for the maximum clique problem
The maximum edge biclique problem is NP-complete
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
Invariant Semidefinite Programs
A new graph parameter related to bounded rank positive semidefinite matrix completions
Intersecting families of discrete structures are typically trivial
QUANTUM ZERO-ERROR CAPACITY
Optimization and operations research in mitigation of a pandemic
Solving \(k\)-cluster problems to optimality with semidefinite programming
Large regular bipartite graphs with median eigenvalue 1
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Constructive lower bounds for off-diagonal Ramsey numbers
The Maximum k-Colorable Subgraph Problem and Related Problems
Improving an upper bound on the size of \(k\)-regular induced subgraphs
Linearly independent vertices and minimum semidefinite rank
Lower bounds in minimum rank problems
An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem

   Recommendations

The Shannon capacity of a union 👍 👎
On the Shannon capacity of a directed graph 👍 👎
An Analogue of the Shannon Capacity of a Graph 👍 👎
Title not available (Why is that?) 👍 👎
On the Shannon capacity of probabilistic graphs 👍 👎

This page was built for publication: On the Shannon capacity of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178914)