On the Shannon capacity of a graph

Recommendations

The Shannon capacity of a union
On the Shannon capacity of a directed graph
An Analogue of the Shannon Capacity of a Graph
scientific article; zbMATH DE number 2197920
On the Shannon capacity of probabilistic graphs

Cited in

(only showing first 100 items - show all)

Block-diagonal semidefinite programming hierarchies for 0/1 programming
The Laplacian spectral radius of a graph under perturbation
Laplacian eigenvalues and partition problems in hypergraphs
On the Lovász $\vartheta$-number of almost regular graphs with application to Erdős-Rényi graphs
On types of growth for graph-different permutations
Commutative association schemes
$L(2,1)$-labeling of strong products of cycles
Exploiting special structure in semidefinite programming: a survey of theory and applications
Lower bounds in minimum rank problems
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Lower bounds for measurable chromatic numbers
On the Shannon capacity of a directed graph
Relaxations of vertex packing
The independence number of the strong product of cycles
A new linear programming algorithm - better or worse than the simplex method?
An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions
The ellipsoid method and its consequences in combinatorial optimization
Triangle free graphs that are not $\sqrt{3}$-embeddable in $S^ n$.
Beyond the Erdős-Ko-Rado theorem
A note on vector representation of graphs
The symbiotic relationship of combinatorics and matrix theory
A domain monotonicity theorem for graphs and Hamiltonicity
A combinatorial approach to complexity
Qualitative independence and Sperner problems for directed graphs
Dual estimates in multiextremal problems
Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
Modified $r$-algorithm to find the global minimum of polynomial functions
Role of redundant constraints for improving dual bounds in polynomial optimization problems
The Shannon capacity of a union
Eigenvalue interlacing and weight parameters of graphs
Stable sets and polynomials
The maximum clique problem
Laplacian matrices of graphs: A survey
On the Shannon capacity of probabilistic graphs
Different capacities of a digraph
Capacities: From information theory to extremal set theory
Motivations and history of some of my conjectures
Eigenvalues, eigenspaces and distances to subsets
Semidefinite programming in combinatorial optimization
Randomized graph products, chromatic numbers, and the Lovász $\vartheta$-function
Approximating the independence number via the -function
Dot product representations of graphs
On reducibility and symmetry of disjoint NP pairs.
The maximum edge biclique problem is NP-complete
Best ellipsoidal relaxation to solve a nonconvex problem.
Laplacian eigenvalues and fixed size multisection
On the rank of a matrix associated with a graph.
The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
Spectral characterizations of the Lovász number and the Delsarte number of a graph
An exponential gap with the removal of one negation gate
Heuristics for semirandom graph problems
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
A semidefinite approach to the $K_i$-cover problem
Sabidussi versus Hedetniemi for three variations of the chromatic number
A semidefinite programming approach to a cross-intersection problem with measures
New lower bound on the Shannon capacity of $C_7$ from circular graphs
Independence number of products of Kneser graphs
Notes on computational-to-statistical gaps: predictions using statistical physics
Multipartite composition of contextuality scenarios
Quantum privacy and Schur product channels
Random Laplacian matrices and convex relaxations
Optimization over structured subsets of positive semidefinite matrices via column generation
On the Lovász theta function and some variants
Strengthening the Lovász $\theta(\overline G)$ bound for graph coloring
An improved semidefinite programming relaxation for the satisfiability problem
The k-regular induced subgraph problem
The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
On the capacity of Boolean graph formulæ
Matchings and covers in hypergraphs
The gap between monotone and non-monotone circuit complexity is exponential
Orthogonal representations and connectivity of graphs
Geometrical embeddings of graphs
Improved lower bound on the Shannon capacity of C₇
Bicliques and eigenvalues
The k-fractal of a simplicial complex
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
On the ultimate independence ratio of a graph
The geometry of graphs and some of its algorithmic applications
Interlacing eigenvalues and graphs
A recipe for semidefinite relaxation for $(0,1)$-quadratic programming
On the ultimate normalized chromatic difference sequence of a graph
On product of association schemes and Shannon capacity
An upper bound on the independence number of a graph computable in polynomial-time
Diversification strategies in tabu search algorithms for the maximum clique problem
On the bounds for the ultimate independence ratio of a graph
Solving $k$-cluster problems to optimality with semidefinite programming
On the Shannon capacity of triangular graphs
Control and estimation under information constraints: toward a unified theory of control, computation and communications
Sandwich theorems and capacity bounds for non-commutative graphs
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Partitioning transitive tournaments into isomorphic digraphs
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
On the arithmetic mean of the size of cross-union families
Tensor theta norms and low rank recovery
A unified construction of semiring-homomorphic graph invariants
On the N-spectrum of oriented graphs
Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis
Probabilistic refinement of the asymptotic spectrum of 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)