Béla Bollobás
E860728
Béla Bollobás is a Hungarian-born British mathematician renowned for his influential work in combinatorics, graph theory, and discrete mathematics.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Béla Bollobás canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T10370925 — 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: Béla Bollobás Context triple: [Euler Medal, notableRecipient, Béla Bollobás]
-
A.
László Lovász
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.
-
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.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
- 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: Béla Bollobás Target entity description: Béla Bollobás is a Hungarian-born British mathematician renowned for his influential work in combinatorics, graph theory, and discrete mathematics.
-
A.
László Lovász
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.
-
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.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
human
ⓘ
mathematician ⓘ |
| academicStatus | professor ⓘ |
| awardReceived |
Lanchester Prize
NERFINISHED
ⓘ
Senior Whitehead Prize NERFINISHED ⓘ Széchenyi Prize NERFINISHED ⓘ Whitehead Prize NERFINISHED ⓘ |
| birthCountry | Hungary NERFINISHED ⓘ |
| birthDate | 1943-08-03 ⓘ |
| birthPlace | Budapest NERFINISHED ⓘ |
| countryOfCitizenship |
Hungary
ⓘ
United Kingdom ⓘ |
| doctoralAdvisor | Frank P. Ramsey’s school of combinatorics tradition ⓘ |
| educatedAt |
Eötvös Loránd University
NERFINISHED
ⓘ
Cambridge University ⓘ
surface form:
University of Cambridge
|
| employer |
Trinity College, Cambridge
NERFINISHED
ⓘ
Cambridge University ⓘ
surface form:
University of Cambridge
University of Memphis NERFINISHED ⓘ |
| familyName | Bollobás NERFINISHED ⓘ |
| fieldOfWork |
combinatorics
ⓘ
discrete mathematics ⓘ functional analysis ⓘ graph theory ⓘ probability theory ⓘ |
| gender | male ⓘ |
| givenName | Béla NERFINISHED ⓘ |
| hasWritten |
Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics
NERFINISHED
ⓘ
Extremal Graph Theory NERFINISHED ⓘ Modern Graph Theory NERFINISHED ⓘ Percolation NERFINISHED ⓘ Random Graphs NERFINISHED ⓘ The Art of Mathematics: Coffee Time in Memphis NERFINISHED ⓘ |
| knownFor |
Bollobás set pairs inequality
NERFINISHED
ⓘ
Bollobás–Thomason inequality NERFINISHED ⓘ extremal graph theory ⓘ isoperimetric inequalities in discrete settings ⓘ random graphs ⓘ work on percolation theory ⓘ |
| languageOfWorkOrName |
English
ⓘ
Hungarian ⓘ |
| memberOf | Royal Society ⓘ |
| name | Béla Bollobás NERFINISHED ⓘ |
| notableStudent |
Imre Leader
NERFINISHED
ⓘ
Oliver Riordan NERFINISHED ⓘ |
| notableWork | development of modern extremal combinatorics ⓘ |
| positionHeld |
Chair of Combinatorics at the University of Cambridge
ⓘ
J. T. F. Trotter Jr. Chair in Mathematics at the University of Memphis NERFINISHED ⓘ |
| residence |
United Kingdom
ⓘ
United States of America ⓘ
surface form:
United States
|
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: Béla Bollobás Description of subject: Béla Bollobás is a Hungarian-born British mathematician renowned for his influential work in combinatorics, graph theory, and discrete mathematics.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.