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.
- Quantum graph homomorphisms via operator systems (Q254876) (← links)
- Quantum homomorphisms (Q257001) (← links)
- On the independence number of some strong products of cycle-powers (Q275570) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Conic formulations of graph homomorphisms (Q295829) (← links)
- A simple removal lemma for large nearly-intersecting families (Q322197) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Classical, quantum and nonsignalling resources in bipartite games (Q387029) (← links)
- A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces (Q387573) (← links)
- On the independence numbers of the cubes of odd cycles (Q396806) (← links)
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
- Computing the Grothendieck constant of some graph classes (Q408441) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (Q411372) (← links)
- Graphs associated with vector spaces of even dimension: A link with differential geometry (Q417560) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- Chance constrained \(0-1\) quadratic programs using copulas (Q499685) (← links)
- Independent sets in graphs (Q501998) (← links)
- Four-dimensional polytopes of minimum positive semidefinite rank (Q507805) (← links)
- On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
- On Minkowski space and finite geometry (Q507825) (← links)
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set (Q510956) (← links)
- A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
- Graph connectivity and universal rigidity of bar frameworks (Q516906) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- A class of semidefinite programs with rank-one solutions (Q551300) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- Vector representations of graphs (Q584287) (← links)
- The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs (Q594904) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Perfect matchings as IID factors on non-amenable groups (Q648969) (← links)
- Forbiddance and capacity (Q659716) (← links)
- The cardinality of the collection of maximum independent sets of a functional graph (Q678609) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
