On the Shannon capacity of a graph
From MaRDI portal
Publication:4178914
DOI10.1109/TIT.1979.1055985zbMATH Open0395.94021DBLPjournals/tit/Lovasz79WikidataQ29013070 ScholiaQ29013070MaRDI QIDQ4178914FDOQ4178914
Authors: László Lovász 
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Petersen graphpentagonself-complementary graphShannon zero error capacityvertex transitive automorphism group
Cited In (only showing first 100 items - show all)
- Vector representation of graph domination
- Asymptotic values of the Hall-ratio for graph powers
- On the rank of a matrix associated with a graph.
- Positive matching decompositions of graphs
- On cover-structure graphs
- Classes of representable disjoint \textsf{NP}-pairs
- Applications of Ramsey theory
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- Heuristics for semirandom graph problems
- An exponential gap with the removal of one negation gate
- The minimum rank problem for circulants
- A survey on graphs with convex quadratic stability number
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- A note on vector representation of graphs
- Geometric representations of graphs
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Some observations on the smallest adjacency eigenvalue of a graph
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- Zero-error stationary coding over stationary channels
- Laplacian eigenvalues and fixed size multisection
- Relative capacity and dimension of graphs
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- On the bandwidth of the Kneser graph
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Triangle free graphs that are not \(\sqrt{3}\)-embeddable in \(S^ n\).
- On circular-perfect graphs: a survey
- Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Primal-dual first-order methods for a class of cone programming
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- On the conjunctive capacity of graphs
- On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions
- On coverings of tori with cubes
- Developments in the theory of graph spectra
- On the capacity of uniform hypergraphs
- The complexity of unions of disjoint sets
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- Bicliques and eigenvalues
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- On the dimension to represent a graph by a unit distance graph
- Probabilistic refinement of the asymptotic spectrum of graphs
- On the bounds for the ultimate independence ratio of a graph
- On the Shannon capacity of a directed graph
- A new linear programming algorithm - better or worse than the simplex method?
- The minrank of random graphs over arbitrary fields
- Violating the Shannon capacity of metric graphs with entanglement
- Quantum graph homomorphisms via operator systems
- Quantum homomorphisms
- Conic formulations of graph homomorphisms
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
- Matrix convex hulls of free semialgebraic sets
- The maximum clique problem
- Polytopes of minimum positive semidefinite rank
- Title not available (Why is that?)
- On the independence number of some strong products of cycle-powers
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- A characterization of Delsarte's linear programming bound as a ratio bound
- On the independence numbers of the cubes of odd cycles
- An orthogonal basis for functions over a slice of the Boolean hypercube
- Title not available (Why is that?)
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- Semidefinite representations for finite varieties
- Exponential lower bounds for polytopes in combinatorial optimization
- A domain monotonicity theorem for graphs and Hamiltonicity
- On the isoperimetric spectrum of graphs and its approximations
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Quadratic forms on graphs
- The ellipsoid method and its consequences in combinatorial optimization
- A boundary point method to solve semidefinite programs
- Laplacian matrices of graphs: A survey
- Stable sets and polynomials
- High-accuracy solution of large-scale semidefinite programs
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Copositive optimization -- recent developments and applications
- Randomly colouring graphs (a combinatorial view)
- Interlacing eigenvalues and graphs
- The \(k\)-regular induced subgraph problem
- Control and estimation under information constraints: toward a unified theory of control, computation and communications
- New heuristics for the vertex coloring problem based on semidefinite programming
- The exact bound in the Erdős-Ko-Rado theorem
- The geometry of graphs and some of its algorithmic applications
- Laplace eigenvalues of graphs---a survey
- The sheaf-theoretic structure of non-locality and contextuality
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Chance constrained \(0-1\) quadratic programs using copulas
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Strengthened semidefinite programming bounds for codes
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Classical, quantum and nonsignalling resources in bipartite games
- Improved lower bound on the Shannon capacity of \(C_7\)
- Transference for the Erdős-Ko-Rado theorem
- Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- A simple removal lemma for large nearly-intersecting families
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
This page was built for publication: On the Shannon capacity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178914)
