Lovász
Encyclopedia
Lovász (ˈlovaːs):
- Lázár LovászLázár LovászLázár Lovász is a retired Hungarian athlete who competed in hammer throw. He won a bronze medal at the 1968 Summer Olympics, throwing 69.78 metres.-References:...
(born 1942), a Hungarian athlete who competed in hammer throw - László LovászLászló LovászLászló Lovász is a Hungarian mathematician, best known for his work in combinatorics, for which he was awarded the Wolf Prize and the Knuth Prize in 1999, and the Kyoto Prize in 2010....
(born 1948, Budapest), a mathematician, best known for his work in combinatorics,- Lovász conjectureLovász conjectureIn graph theory, the Lovász conjecture is a classical problem on Hamiltonian paths in graphs. It says:The original article of Lovász stated the result in the opposite, butthis version became standard...
(1970) - Erdős–Faber–Lovász conjectureErdos–Faber–Lovász conjectureIn graph theory, the Erdős–Faber–Lovász conjecture is an unsolved problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972...
(1972) - The Lovász local lemmaLovász local lemmaIn probability theory, if a large number of events are all independent of one another and each has probability less than 1, then there is a positive probability that none of the events will occur...
(proved in 1975, by László Lovász & P. Erdős) - The Lenstra–Lenstra–Lovász lattice basis reduction (algorithm)Lenstra–Lenstra–Lovász lattice basis reduction algorithmThe LLL-reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982, see...
(LLL) - Algorithmic Lovász local lemmaAlgorithmic Lovász local lemmaIn 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....
(proved in 2009, by Robin Moser and Gábor Tardos) - Lovász numberLovász numberIn graph theory, 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 ϑ...
(1979)
- Lovász conjecture