Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,200,651 papers from all fields of science
Search
Sign In
Create Free Account
Lovász number
Known as:
Lovász theta function
, Lovasz number
, Lovasz theta function
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Channel capacity
Complement graph
Ellipsoid method
Eternal dominating set
Expand
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
S. Sardellitti
,
S. Barbarossa
,
P. Lorenzo
IEEE Journal on Selected Topics in Signal…
2016
Corpus ID: 38519513
The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or…
Expand
2016
2016
Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity
Xin Wang
,
R. 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…
Expand
Highly Cited
2016
Highly Cited
2016
Quantum homomorphisms
L. Mančinska
,
D. Roberson
Journal of combinatorial theory. Series B (Print)
2016
Corpus ID: 27682971
Highly Cited
2014
Highly Cited
2014
Estimating quantum chromatic numbers
V. Paulsen
,
S. Severini
,
D. Stahlke
,
I. Todorov
,
A. Winter
2014
Corpus ID: 54922560
2013
2013
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants
T. Cubitt
,
L. Mančinska
,
D. Roberson
,
S. Severini
,
D. Stahlke
,
A. Winter
IEEE Transactions on Information Theory
2013
Corpus ID: 14530220
We study zero-error entanglement-assisted source-channel coding (communication in the presence of side information). Adapting a…
Expand
Highly Cited
2010
Highly Cited
2010
Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
R. Duan
,
S. Severini
,
A. Winter
IEEE Transactions on Information Theory
2010
Corpus ID: 4690143
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we…
Expand
2010
2010
Entanglement-assisted zero-error capacity is upper bounded by the Lovasz theta function
S. Beigi
ArXiv
2010
Corpus ID: 834497
The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor…
Expand
Highly Cited
1991
Highly Cited
1991
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
C. Schnorr
,
M. Euchner
International Symposium on Fundamentals of…
1991
Corpus ID: 15386054
We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of theL3…
Expand
Highly Cited
1988
Highly Cited
1988
On the communication complexity of graph properties
A. Hajnal
,
W. Maass
,
György Turán
Symposium on the Theory of Computing
1988
Corpus ID: 17495443
We prove <italic>&thgr;</italic>(<italic>n</italic> log <italic>n</italic>) bounds for the deterministic 2-way communication…
Expand
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…
Expand
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)
ACCEPT & CONTINUE