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.
- On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions (Q1166570) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Triangle free graphs that are not \(\sqrt{3}\)-embeddable in \(S^ n\). (Q1172067) (← links)
- Beyond the Erdős-Ko-Rado theorem (Q1174149) (← links)
- A note on vector representation of graphs (Q1175424) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- A domain monotonicity theorem for graphs and Hamiltonicity (Q1192950) (← links)
- A combinatorial approach to complexity (Q1196691) (← links)
- Qualitative independence and Sperner problems for directed graphs (Q1199993) (← links)
- Dual estimates in multiextremal problems (Q1201906) (← links)
- Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities (Q1279873) (← links)
- Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- The Shannon capacity of a union (Q1297763) (← links)
- Eigenvalue interlacing and weight parameters of graphs (Q1300913) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- The maximum clique problem (Q1318271) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- On the Shannon capacity of probabilistic graphs (Q1325239) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Eigenvalues, eigenspaces and distances to subsets (Q1356741) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- On the capacity of digraphs (Q1378288) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- Dot product representations of graphs (Q1381853) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- The maximum edge biclique problem is NP-complete (Q1414242) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Laplacian eigenvalues and fixed size multisection (Q1422418) (← links)
- On the rank of a matrix associated with a graph. (Q1422421) (← links)
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős (Q1428861) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- An exponential gap with the removal of one negation gate (Q1603543) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- A semidefinite approach to the $K_i$-cover problem (Q1667210) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- A semidefinite programming approach to a cross-intersection problem with measures (Q1683683) (← links)
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) (← links)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Multipartite composition of contextuality scenarios (Q1735897) (← links)
- Quantum privacy and Schur product channels (Q1748961) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
