Hungarian school of combinatorics
E895559
The Hungarian school of combinatorics is a highly influential tradition in discrete mathematics centered in Hungary, renowned for its deep results, problem-solving culture, and leading figures such as Paul Erdős and his collaborators.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Hungarian school of combinatorics canonical | 2 |
| Hungarian mathematical school | 1 |
| Hungarian school of mathematics | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10944639 — 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: Hungarian school of combinatorics Context triple: [Lajos Pósa, isPartOf, Hungarian school of combinatorics]
-
A.
Institute of Combinatorics and its Applications
The Institute of Combinatorics and its Applications is an international scholarly organization devoted to advancing research, collaboration, and recognition in the field of combinatorics.
-
B.
Erdős on Graphs: His Legacy
Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
-
C.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
D.
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.
-
E.
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.
- 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: Hungarian school of combinatorics Target entity description: The Hungarian school of combinatorics is a highly influential tradition in discrete mathematics centered in Hungary, renowned for its deep results, problem-solving culture, and leading figures such as Paul Erdős and his collaborators.
-
A.
Institute of Combinatorics and its Applications
The Institute of Combinatorics and its Applications is an international scholarly organization devoted to advancing research, collaboration, and recognition in the field of combinatorics.
-
B.
Erdős on Graphs: His Legacy
Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
-
C.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (102)
| Predicate | Object |
|---|---|
| instanceOf |
mathematical school
ⓘ
research tradition ⓘ |
| country | Hungary ⓘ |
| field |
combinatorics
ⓘ
discrete mathematics ⓘ |
| hasCharacteristic |
collaborative research style
ⓘ
emphasis on deep problems ⓘ problem-solving culture ⓘ strong international collaborations ⓘ use of extremal methods ⓘ use of probabilistic methods ⓘ |
| hasInfluenceOn |
global combinatorics research
ⓘ
information theory ⓘ theoretical computer science ⓘ theory of graph limits ⓘ theory of random graphs ⓘ |
| hasInstitutionalCenter |
Alfréd Rényi Institute of Mathematics
ⓘ
Budapest University of Technology and Economics ⓘ Eötvös Loránd University ⓘ Hungarian Academy of Sciences ⓘ |
| hasNotableFigure |
András Frank
ⓘ
András Gyárfás ⓘ András Hajnal ⓘ András Sárközy ⓘ Balázs Patkós ⓘ Balázs Szegedy ⓘ Bence Borda ⓘ Béla Bollobás ⓘ Dániel Gerbner ⓘ Endre Szemerédi ⓘ Gyula Katona ⓘ Gyula O. H. Katona ⓘ Gábor Halász ⓘ Gábor N. Sárközy ⓘ Gábor Pete ⓘ Gábor Simonyi ⓘ Gábor Tardos ⓘ Gábor Tóth ⓘ Géza Tóth ⓘ Imre Bárány ⓘ Imre Ruzsa ⓘ István Győri ⓘ István Juhász ⓘ István Tomon ⓘ János Komlós ⓘ János Körner ⓘ János Pach ⓘ József Beck ⓘ Katalin Vesztergombi ⓘ Lajos Pósa ⓘ László A. Székely ⓘ László Babai ⓘ László Fejes Tóth ⓘ László Lovász ⓘ László Pyber ⓘ Miklós Ajtai ⓘ
linked to:
Miklos Ajtai
Miklós Laczkovich ⓘ Miklós Simonovits ⓘ Máté Matolcsi ⓘ Paul Erdős ⓘ
linked to:
Pál Erdős
Pál Turán ⓘ Péter Frankl ⓘ Tamás Rónyai ⓘ Tamás Szőnyi ⓘ Tibor Gallai ⓘ Vera T. Sós ⓘ
linked to:
Vera Sós
Zoltán Füredi ⓘ Zoltán Király ⓘ Zoltán L. Nagy ⓘ
linked to:
Zoltán Nagy
Zsolt Tuza ⓘ |
| knownFor |
Erdős–Gallai theorems
ⓘ
linked to:
Erdős–Gallai theorem
Erdős–Ginzburg–Ziv theorem ⓘ Erdős–Ko–Rado theorem ⓘ Erdős–Ko–Rado type problems ⓘ
linked to:
Erdős–Ko–Rado theorem
Erdős–Rényi random graph model ⓘ
linked to:
Erdős–Rényi model
Erdős–Stone theorem ⓘ Erdős–Szekeres theorem ⓘ Hamiltonian graphs ⓘ
linked to:
Hamiltonian cycle concept
Ramsey theory ⓘ Ramsey-type problems ⓘ Szemerédi's theorem ⓘ Turán-type extremal problems ⓘ additive combinatorics ⓘ algorithmic combinatorics ⓘ combinatorial number theory ⓘ combinatorial optimization ⓘ combinatorial probability ⓘ combinatorial set systems ⓘ discrete geometry ⓘ extremal combinatorics ⓘ finite geometry ⓘ graph coloring ⓘ graph limits ⓘ graph theory ⓘ hypergraph theory ⓘ matching theory ⓘ poset theory ⓘ probabilistic method ⓘ random graphs ⓘ regularity lemma ⓘ
linked to:
Szemerédi regularity lemma
|
| language |
English
ⓘ
Hungarian ⓘ
linked to:
Hungarian language
|
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: Hungarian school of combinatorics Description of subject: The Hungarian school of combinatorics is a highly influential tradition in discrete mathematics centered in Hungary, renowned for its deep results, problem-solving culture, and leading figures such as Paul Erdős and his collaborators.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Hungarian school of combinatorics
linked to: Hungarian school of combinatorics