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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Two classical upper bounds on the Shannon capacity of graphs are the θ-function due to Lovász and the minrank parameter due to… (More)
Is this relevant?
2017
2017
We show that for any graph G, by considering “activation” through the strong product with another graph H , the relation αpGq… (More)
Is this relevant?
2016
2016
We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the… (More)
  • figure 1
Is this relevant?
2014
2014
If G is a triangle-free graph, then two Gallai identities can be written as α(G) + χ(L(G)) = |V (G)| = α(L(G)) + χ(G), where… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2013
2013
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we… (More)
Is this relevant?
2012
2012
In the seminal work [8] L. Lovász introduced the concept of an orthonormal representation of a graph, and also a related value… (More)
Is this relevant?
2011
2011
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we… (More)
Is this relevant?
2007
2007
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166–190] showed how to formulate increasingly tight approximations of the… (More)
Is this relevant?
2000
2000
  • A. GALTMAN
  • 2000
This paper gives spectral characterizations of two closely related graph functions: the Lov ́ asz number θ and a generalization… (More)
Is this relevant?