Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Lovász number

Known as: Lovász theta function, Lovasz number, Lovasz theta function 
In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lov… Expand
Wikipedia

Related topics

Related topics

14 relations
Channel capacityComplement graphEllipsoid methodEternal dominating set
Expand

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
On the Graph Fourier Transform for Directed Graphs
The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Linear Index Coding via Semidefinite Programming
In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers… Expand
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
We prove that an ω(log3n) lower bound for the three-party number-on-the-forehead (NOF) communication complexity of the set… Expand
Is this relevant?
2005
2005
The Lovász Number of Random Graphs
We study the Lovasz number $\vartheta$ along with two related SDP relaxations $\vartheta_{1/2}$, $\vartheta_2$ of the… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming
Sherali and Adams [SA90], Lov\''asz and Schrijver [LS91] and, recently, Lasserre [Las01b] have proposed lift and project methods… Expand
Is this relevant?
2000
2000
CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS
  • O SIAMJ.
  • 2000
    • Corpus ID: 16396851
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of theL3… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
On the communication complexity of graph properties
We prove <italic>&thgr;</italic>(<italic>n</italic> log <italic>n</italic>) bounds for the deterministic 2-way communication… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A comparison of the Delsarte and Lovász bounds
Delsarte's linear programming bound (an upper bound on the cardinality of cliques in association schemes) is compared with Lov… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE