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.
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Book review of: L. Lovász, Graphs and geometry (Q2143334) (← links)
- Information theoretic parameters of noncommutative graphs and convex corners (Q2152773) (← links)
- On coverings of tori with cubes (Q2155323) (← links)
- Faithful orthogonal representations of graphs from partition logics (Q2156425) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← links)
- More on signed graphs with at most three eigenvalues (Q2158204) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- Positive matching decompositions of graphs (Q2166243) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- Duality of graph invariants (Q2193958) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Graphical designs and extremal combinatorics (Q2197221) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs (Q2225456) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- Quantum violation of the suppes-zanotti inequalities and ``contextuality'' (Q2239595) (← links)
- Maximum values of degree-based entropies of bipartite graphs (Q2242733) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
- Intersecting families of discrete structures are typically trivial (Q2258906) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- The asymptotic spectrum of graphs and the Shannon capacity (Q2288365) (← links)
- Some observations on the smallest adjacency eigenvalue of a graph (Q2295999) (← links)
- The minrank of random graphs over arbitrary fields (Q2303679) (← links)
- Divergent permutations (Q2306003) (← links)
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum (Q2306004) (← links)
- Semidefinite programming bounds for Lee codes (Q2312798) (← links)
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior (Q2314153) (← links)
- Lower bounds for the measurable chromatic number of the hyperbolic plane (Q2316800) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- The theta number of simplicial complexes (Q2317686) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- Spectral lower bounds for the orthogonal and projective ranks of a graph (Q2323822) (← links)
- On upper bounding Shannon capacity of graph through generalized conic programming (Q2329653) (← links)
- Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs (Q2332386) (← links)
- Lovász theta type norms and operator systems (Q2341906) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← links)
- On the number of union-free families (Q2357013) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Variational analysis of the Ky Fan \(k\)-norm (Q2359140) (← links)
