Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Channel capacityComplement graphEllipsoid methodEternal dominating set

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
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… 
2016
2016
Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity
  • Xin WangR. Duan
  • IEEE Transactions on Information Theory
  • 2016
  • Corpus ID: 3430364
Quantum Lovász number is a quantum generalization of the Lovász number in graph theory. It is the best known efficiently… 
Highly Cited
2016
Highly Cited
2016
Quantum homomorphisms
Highly Cited
2014
Highly Cited
2014
Estimating quantum chromatic numbers
2013
2013
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants
We study zero-error entanglement-assisted source-channel coding (communication in the presence of side information). Adapting a… 
Highly Cited
2010
Highly Cited
2010
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… 
2010
2010
Entanglement-assisted zero-error capacity is upper bounded by the Lovasz theta function
The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor… 
Highly Cited
1991
Highly Cited
1991
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… 
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… 
Highly Cited
1979
Highly Cited
1979
A comparison of the Delsarte and Lovász bounds
  • A. Schrijver
  • IEEE Transactions on Information Theory
  • 1979
  • Corpus ID: 31151844
Delsarte's linear programming bound (an upper bound on the cardinality of cliques in association schemes) is compared with Lov… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)