László Lovász
E765974
László Lovász is a Hungarian mathematician renowned for his fundamental contributions to combinatorics, graph theory, and theoretical computer science, including work on the Lovász Local Lemma and the proof of the weak perfect graph conjecture.
All labels observed (1)
| Label | Occurrences |
|---|---|
| László Lovász canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T8669840 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: László Lovász Context triple: [Pál Turán, influenced, László Lovász]
-
A.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
B.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
-
C.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
D.
Pál Erdős
Pál Erdős was a highly prolific 20th-century Hungarian mathematician renowned for his extensive contributions to number theory, combinatorics, and discrete mathematics, as well as his famously collaborative working style.
-
E.
Endre Szemerédi
Endre Szemerédi is a Hungarian-American mathematician renowned for his fundamental contributions to combinatorics and theoretical computer science, including Szemerédi's theorem on arithmetic progressions.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: László Lovász Target entity description: László Lovász is a Hungarian mathematician renowned for his fundamental contributions to combinatorics, graph theory, and theoretical computer science, including work on the Lovász Local Lemma and the proof of the weak perfect graph conjecture.
-
A.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
B.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
-
C.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
D.
Pál Erdős
Pál Erdős was a highly prolific 20th-century Hungarian mathematician renowned for his extensive contributions to number theory, combinatorics, and discrete mathematics, as well as his famously collaborative working style.
-
E.
Endre Szemerédi
Endre Szemerédi is a Hungarian-American mathematician renowned for his fundamental contributions to combinatorics and theoretical computer science, including Szemerédi's theorem on arithmetic progressions.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
human
ⓘ
mathematician ⓘ |
| awardReceived |
Bolyai Prize
NERFINISHED
ⓘ
Fulkerson Prize NERFINISHED ⓘ Gödel Prize NERFINISHED ⓘ John von Neumann Theory Prize NERFINISHED ⓘ Knuth Prize NERFINISHED ⓘ Kyoto Prize in Basic Sciences NERFINISHED ⓘ Széchenyi Prize NERFINISHED ⓘ Wolf Prize in Mathematics NERFINISHED ⓘ |
| countryOfCitizenship | Hungary ⓘ |
| dateOfBirth | 1948-03-09 ⓘ |
| doctoralAdvisor | Tibor Gallai NERFINISHED ⓘ |
| doctoralStudent |
András Frank
NERFINISHED
ⓘ
László Babai NERFINISHED ⓘ Éva Tardos NERFINISHED ⓘ |
| educatedAt | Eötvös Loránd University NERFINISHED ⓘ |
| employer |
Eötvös Loránd University
NERFINISHED
ⓘ
Microsoft Research NERFINISHED ⓘ University of Szeged NERFINISHED ⓘ Yale University ⓘ |
| familyName | Lovász NERFINISHED ⓘ |
| fieldOfWork |
combinatorics
ⓘ
graph theory ⓘ mathematics ⓘ theoretical computer science ⓘ |
| givenName | László NERFINISHED ⓘ |
| knownFor |
Lovász Local Lemma
NERFINISHED
ⓘ
Lovász theta function NERFINISHED ⓘ algorithmic graph theory ⓘ perfect graph theorem NERFINISHED ⓘ theory of graph limits ⓘ weak perfect graph conjecture ⓘ work on Shannon capacity of graphs ⓘ |
| languageSpoken |
English
ⓘ
Hungarian ⓘ |
| memberOf |
Academia Europaea
NERFINISHED
ⓘ
American Academy of Arts and Sciences ⓘ Hungarian Academy of Sciences NERFINISHED ⓘ National Academy of Sciences of the United States NERFINISHED ⓘ Royal Netherlands Academy of Arts and Sciences NERFINISHED ⓘ |
| name | László Lovász NERFINISHED ⓘ |
| notableWork |
Combinatorial Problems and Exercises
NERFINISHED
ⓘ
Geometric Representations of Graphs NERFINISHED ⓘ Large Networks and Graph Limits NERFINISHED ⓘ |
| placeOfBirth | Budapest ⓘ |
| positionHeld | president of the Hungarian Academy of Sciences ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: László Lovász Description of subject: László Lovász is a Hungarian mathematician renowned for his fundamental contributions to combinatorics, graph theory, and theoretical computer science, including work on the Lovász Local Lemma and the proof of the weak perfect graph conjecture.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.