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.
2014
2014
Lov\'asz theta type norms and Operator Systems
2014
2014
Conic formulations of graph homomorphisms
Given graphs X and Y, we define two conic feasibility programs which we show have a solution over the completely positive cone if… 
2013
2013
Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives
Utilizing dual descriptions of the normal cone of convex optimization problems in conic form, we characterize the vertices of… 
2011
2011
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… 
2006
2006
Ethnicity and Gender in the Face of a Terrorist Attack: A National Longitudinal Study of Immediate Responses and Outcomes Two Years After September 11
This study examines ethnic and gender differences in open-ended immediate responses to an online prompt provided by a nationwide… 
Highly Cited
2002
Highly Cited
2002
On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function
. The problem of colouring a k -colourable graph is well-known to be NP-complete, for k ≥ 3. The MAX- k -CUT approach to… 
2000
2000
CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS
Let F be a compact subset of the n-dimensional Euclidean space R represented by (finitely or infinitely many) quadratic… 
2000
2000
On the Lovász Number of Certain Circulant Graphs
The theta function of a graph, also known as the Lovasz number, has the remarkable property of being computable in polynomial… 
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
1985
Highly Cited
1985
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
Laszlo Lovasz recently posed the following problem: “Is there an NC algorithm for testing if a given graph has a unique perfect… 
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)