HOME

TheInfoList



OR:

Lovász (): *
Lázár Lovász Lázár Lovász (born May 24, 1942) is a retired Hungarian athlete who competed in hammer throw. He won a bronze medal at the 1968 Summer Olympics The 1968 Summer Olympics ( es, Juegos Olímpicos de Verano de 1968), officially known as the Ga ...
(born 1942), a Hungarian athlete who competed in hammer throw * László Lovász (born 1948, Budapest), a mathematician, best known for his work in combinatorics, **
Lovász conjecture In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: : Every finite connected vertex-transitive graph contains a Hamiltonian path. Originally László Lovász stated the problem in the opposi ...
(1970) **
Erdős–Faber–Lovász conjecture In graph theory, the Erdős–Faber–Lovász conjecture is a problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972.. It says: :If complete graphs, each having exactly vertices, have ...
(1972) ** The Lovász local lemma (proved in 1975, by László Lovász & P. Erdős) ** The Lenstra–Lenstra–Lovász lattice basis reduction (algorithm) (LLL) **
Algorithmic Lovász local lemma In theoretical computer science, the algorithmic Lovász local lemma gives an algorithmic way of constructing objects that obey a system of constraints with limited dependence. Given a finite set of ''bad'' events in a probability space with limi ...
(proved in 2009, by Robin Moser and Gábor Tardos) **
Lovász number 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ász theta function and is commonly denoted by \vartheta(G), using a script form of the Greek letter ...
(1979) {{DEFAULTSORT:Lovasz Hungarian-language surnames