On the Shannon capacity of a graph
From MaRDI portal
Publication:4178914
Recommendations
Cited in
(only showing first 100 items - show all)- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Vector representations of graphs
- A class of semidefinite programs with rank-one solutions
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Strengthening Chvátal-Gomory cuts for the stable set problem
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Quantum no-signalling correlations and non-local games
- Quantum graph homomorphisms via operator systems
- Quantum homomorphisms
- A bound on the Shannon capacity via a linear programming variation
- Maximum values of degree-based entropies of bipartite graphs
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- Constraint and satisfiability reasoning for graph coloring
- Estimating quantum chromatic numbers
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Conic formulations of graph homomorphisms
- Notes on computational-to-statistical gaps: predictions using statistical physics
- On the Shannon capacity of sums and products of graphs
- Dynamic node packing
- Dual bounds for the positive definite functions approach to mutually unbiased bases
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Vector representation of graph domination
- Violating the Shannon capacity of metric graphs with entanglement
- A “simple” rectangular puzzle
- A robust algorithm for semidefinite programming
- Improving an upper bound on the size of \(k\)-regular induced subgraphs
- The asymptotic spectrum of graphs and the Shannon capacity
- Lovász theta type norms and operator systems
- scientific article; zbMATH DE number 7559384 (Why is no real title available?)
- Approximating the orthogonality dimension of graphs and hypergraphs
- On the rank of a matrix associated with a graph.
- Asymptotic values of the Hall-ratio for graph powers
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
- Linearly independent vertices and minimum semidefinite rank
- Origins and genesis
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Constructive lower bounds for off-diagonal Ramsey numbers
- Matrix convex hulls of free semialgebraic sets
- Graphical designs and extremal combinatorics
- Polytopes of minimum positive semidefinite rank
- Relaxations of combinatorial problems via association schemes
- A recursive Lovász theta number for simplex-avoiding sets
- The maximum clique problem
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Removal and stability for Erdős-Ko-Rado
- Semi-definite programming and quantum information
- On upper bounding Shannon capacity of graph through generalized conic programming
- scientific article; zbMATH DE number 7561683 (Why is no real title available?)
- Lower bounds in minimum rank problems
- Book drawings of complete bipartite graphs
- Computing the Grothendieck constant of some graph classes
- Completing bases in four dimensions
- Mathematical programming models and exact algorithms
- A new property of the Lovász number and duality relations between graph parameters
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
- On cover-structure graphs
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- More tales of Hoffman: bounds for the vector chromatic number of a graph
- Spectrum of Johnson graphs
- On types of growth for graph-different permutations
- Positive matching decompositions of graphs
- On minrank and forbidden subgraphs
- On the independence number of some strong products of cycle-powers
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Chromatic Gallai identities operating on Lovász number
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- Some advances on lovász-schrijver \(N_+(\cdot)\) relaxations of the fractional stable set polytope
- Classes of representable disjoint \textsf{NP}-pairs
- The Laplacian spectral radius of a graph under perturbation
- scientific article; zbMATH DE number 2197920 (Why is no real title available?)
- A geometric approach to betweenness
- Sylow subgraphs in self-complementary vertex transitive graphs
- Independence numbers of product graphs
- On the independence numbers of the cubes of odd cycles
- Multipartite composition of contextuality scenarios
- A feasible method for general convex low-rank SDP problems
- A characterization of Delsarte's linear programming bound as a ratio bound
- Convex hulls of algebraic sets
- Dual estimates in multiextremal problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Sperner capacities
- Graphs associated with vector spaces of even dimension: A link with differential geometry
- Privileged users in zero-error transmission over a noisy channel
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- Sandwich theorems and capacity bounds for non-commutative graphs
- Complete positivity and distance-avoiding sets
- A note on acyclic coloring of strong product of graphs
- Spectral lower bounds for the orthogonal and projective ranks of a graph
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- An orthogonal basis for functions over a slice of the Boolean hypercube
- The Erdős matching conjecture and concentration inequalities
- Applications of Ramsey theory
- A semidefinite programming-based heuristic for graph coloring
- Dimension Reduction for Polynomials over Gaussian Space and Applications
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)
