This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Gyula O. H. Katona | |
|---|---|
| Name | Gyula O. H. Katona |
| Birth date | 1941 |
| Birth place | Budapest, Hungary |
| Nationality | Hungarian |
| Fields | Combinatorics, Graph Theory |
| Alma mater | Eötvös Loránd University, Hungarian Academy of Sciences |
| Doctoral advisor | Pál Erdős |
Gyula O. H. Katona is a Hungarian mathematician known for foundational work in extremal combinatorics, intersecting families, and isoperimetric inequalities. He contributed key theorems that influenced research in probability theory, computer science, and statistical mechanics. Katona collaborated with many leading figures and held positions at prominent European and American institutions, shaping modern combinatorial theory.
Born in Budapest, Katona studied at Eötvös Loránd University where he was influenced by mentors associated with the Hungarian Academy of Sciences and the school of Pál Erdős. His doctoral work connected classical problems in Paul Erdős-style extremal combinatorics with methods later used in Frankl–Wilson theorem research and problems related to the Erdős–Ko–Rado theorem. During his formative years he engaged with visiting scholars from Cambridge University, University of Oxford, and the Institute for Advanced Study, situating his training among networks that included figures from John von Neumann's lineage and contemporaries associated with András Sárközy and Lajos Pósa.
Katona held academic posts at institutions including Eötvös Loránd University, various institutes of the Hungarian Academy of Sciences, and visiting appointments at Princeton University, University of California, Berkeley, Massachusetts Institute of Technology, and continental centers such as Université Paris-Sud and Technische Universität München. He participated in programs at the Mathematical Institute, Oxford, the Institut des Hautes Études Scientifiques, and collaborated with researchers linked to Stanford University, Harvard University, University of Cambridge, and University of Chicago. His networks included colleagues from Paul Erdős's circle, collaborators connected to Miklós Simonovits, Béla Bollobás, and younger researchers later associated with Noga Alon and Van H. Vu.
Katona formulated and proved influential combinatorial theorems concerning intersecting families, compression methods, and set systems that impacted studies in graph theory, design theory, and coding theory. His namesake cyclic permutation method and related proofs provided new perspectives on the Erdős–Ko–Rado theorem, connecting to work by Miklós Simonovits, Paul Erdős, Richard Rado, László Lovász, and Péter Frankl. Katona's techniques influenced results in the study of Sperner's theorem, the Kruskall–Katona theorem, and bounds akin to Turán's theorem for hypergraphs. He contributed to extremal set theory that interfaced with probabilistic tools used by Joel Spencer, Jeff Kahn, and Michael Krivelevich, and his results found applications in complexity theory problems treated at centers like Bell Labs and Bellcore.
He worked on isoperimetric inequalities in discrete settings, linking to concepts examined by Moses Schönberg-era analysts and later by Jeff Cheeger and Elias Stein in continuous analogues. Katona's combinatorial constructions were used in generating counterexamples and sharpness results referenced by researchers such as Endre Szemerédi, Alexander Razborov, and Oded Schramm. His collaborative publications connected asymptotic enumeration methods from Béla Bollobás's school to structural graph results associated with János Komlós and Miklós Ajtai.
Katona received recognition from national and international bodies including honors from the Hungarian Academy of Sciences, invitations to speak at conferences organized by the European Mathematical Society and the International Mathematical Union. He was awarded prizes within Hungary comparable to distinctions associated with past recipients like Alfréd Rényi and John von Neumann-era honorees, and was a frequent plenary or invited speaker at meetings such as the International Congress of Mathematicians, European Congress of Mathematics, Fifth European Conference on Combinatorics, Graph Theory and Applications, and symposia hosted by Project Euclid partners. His mentorship produced students who later held positions at Princeton University, Rutgers University, Tel Aviv University, and Technion – Israel Institute of Technology.
Katona authored numerous papers in journals connected to editorial boards including those of Journal of Combinatorial Theory, Combinatorica, Transactions of the American Mathematical Society, and proceedings of meetings at Institute for Advanced Study and Banff International Research Station. His selected works appear alongside contributions by Paul Erdős, Béla Bollobás, László Lovász, Endre Szemerédi, and Noga Alon in collections celebrating developments in extremal combinatorics. Katona's methods continue to be cited in contemporary research by scholars at Columbia University, New York University, University of Toronto, ETH Zurich, and University of Bonn, influencing inquiries in cryptography-adjacent coding problems and algorithmic combinatorics pursued at Carnegie Mellon University and Microsoft Research.
Categories: Category:Hungarian mathematicians, Category:Combinatorialists