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.
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle (Q686982) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- On the chromatic number of a simplicial complex (Q722323) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- On the ideal of orthogonal representations of a graph in \(\mathbb{R}^2\) (Q745075) (← links)
- The exact bound in the Erdős-Ko-Rado theorem (Q761464) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- On the dimension to represent a graph by a unit distance graph (Q804603) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Linearly independent vertices and minimum semidefinite rank (Q836992) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Stability for intersecting families in \(\mathrm{PGL}(2,q)\) (Q907232) (← links)
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- Privileged users in zero-error transmission over a noisy channel (Q950333) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- On the measure of intersecting families, uniqueness and stability (Q963246) (← links)
- On cover-structure graphs (Q967385) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Laplacian eigenvalues and partition problems in hypergraphs (Q1023080) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- On types of growth for graph-different permutations (Q1024371) (← links)
- Commutative association schemes (Q1039424) (← links)
- \(L(2,1)\)-labeling of strong products of cycles (Q1041747) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- On the Shannon capacity of a directed graph (Q1074597) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- The independence number of the strong product of cycles (Q1125025) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q) (Q1163019) (← links)
