Pages that link to "Item:Q4178914"
From MaRDI portal
The following pages link to On the Shannon capacity of a graph (Q4178914):
Displaying 50 items.
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (Q3449986) (← links)
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies (Q3451762) (← links)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
- Fast implementation for semidefinite programs with positive matrix completion (Q3458828) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- Zero-error stationary coding over stationary channels (Q3888959) (← links)
- On the capacity of the arbitrarily varying channel for maximum probability of error (Q3937283) (← links)
- Some Erdös–Ko–Rado Theorems for Chevalley Groups (Q3964570) (← links)
- (Q3980156) (← links)
- On Extremal Set Partitions in Cartesian Product Spaces (Q4289289) (← links)
- Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem (Q4291206) (← links)
- A limit theorem for the Shannon capacities of odd cycles I (Q4417260) (← links)
- Spectral Bounds for the k-Regular Induced Subgraph Problem (Q4554522) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958) (← links)
- Graph Information Ratio (Q4599114) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- QUANTUM ZERO-ERROR CAPACITY (Q4663295) (← links)
- Developments in the theory of graph spectra (Q4723771) (← links)
- A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
- A limit theorem for the Shannon capacities of odd cycles. II (Q4825646) (← links)
- Geometric representations of graphs (Q4853925) (← links)
- Geometric representations of graphs (Q4873485) (← links)
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) (Q4972547) (← links)
- Tight Frame Graphs Arising as Line Graphs (Q4987379) (← links)
- Regularity of parity binomial edge ideals (Q4990329) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- (Q5005186) (← links)
- (Q5009505) (← links)
- (Q5009538) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- Graph Kernels: A Survey (Q5026222) (← links)
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs (Q5026994) (← links)
- Completing bases in four dimensions (Q5049703) (← links)
- Classical simulation of contextuality through hiding the disturbance (Q5049954) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- (Q5053241) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- (Q5089174) (← links)
- (Q5092401) (← links)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism (Q5096588) (← links)
- A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
- Spectral upper bound on the quantum k-independence number of a graph (Q5097504) (← links)
- Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
