László Lovász (Hungarian: [ˈlovaːs ˈlaːsloː]; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best...

Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László...

Lovász (Hungarian pronunciation: [ˈlovaːs]): Lázár Lovász (1942–2023), a Hungarian athlete who competed in hammer throw László Lovász (born 1948, Budapest)...

symmetric version given below. A weaker version was proved in 1975 by László Lovász and Paul Erdős in the article Problems and results on 3-chromatic hypergraphs...

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...

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...

Hamiltonian path. Originally László Lovász stated the problem in the opposite way, but this version became standard. In 1996, László Babai published a conjecture...

field. László Babai (b. 1950), Hungarian-born American mathematician and computer scientist László Lovász (b. 1948), Hungarian mathematician László Fejes...

In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph...

Fulkerson Prize and Abel Prize, the latest of which was Abel Prize winner László Lovász in 2021. The predecessor of Eötvös Loránd University was founded in...