Andrásfai Erdős

Andrásfai Erdős
Name	Andrásfai Erdős
Birth date	1935
Death date	2024
Birth place	Budapest
Nationality	Hungarian
Fields	Graph theory, Combinatorics
Workplaces	Eötvös Loránd University, Hungarian Academy of Sciences

Contents

Andrásfai Erdős

Andrásfai Erdős was a Hungarian mathematician known for contributions to graph theory, combinatorics, and extremal problems connecting Paul Erdős's probabilistic methods with structural theorems in Turán-type settings. His work bridged communities around Eötvös Loránd University, the Hungarian Academy of Sciences, and international conferences such as the International Congress of Mathematicians and meetings organized by the American Mathematical Society. Colleagues and collaborators included figures from the traditions of Pál Turán, László Lovász, Miklós Simonovits, and visitors from institutions like Princeton University, Cambridge University, and ETH Zurich.

Early life and education

Born in Budapest in 1935, he was educated in a milieu shaped by the interwar and postwar Hungarian mathematical schools associated with Eötvös Loránd University and the intellectual legacy of Paul Erdős. He studied under professors linked to the traditions established by Pál Turán and the combinatorial circles around Alfréd Rényi at the Mathematical Institute of the Hungarian Academy of Sciences. His doctoral work connected to topics pursued at Eötvös Loránd University and was influenced by international developments at Princeton University and conferences where methods from Paul Erdős and Paul Turán were prominent.

He held positions at Eötvös Loránd University and the Hungarian Academy of Sciences, teaching courses that drew students from programs associated with Central European University exchanges and visiting scholars from Oxford University, Harvard University, and Yale University. He supervised graduate students who later took positions at institutions such as Rutgers University, University of Cambridge, and University of Chicago. He participated in collaborative networks linking Institut des Hautes Études Scientifiques, Max Planck Society, and the Institute for Advanced Study. His service included roles on committees of the Hungarian Mathematical Society and program committees for meetings of the European Mathematical Society and the American Mathematical Society.

His research focused on extremal graph theory, Ramsey-type problems, and structural results that refined bounds related to Turán's theorem and Mantel's theorem. He proved theorems constraining the independence number and chromatic properties of triangle-free graphs, drawing on methods introduced by Paul Erdős, extensions associated with Václav Chvátal, and connections to the stability method developed by Miklós Simonovits and Endre Szemerédi. His namesake constructions and bounds influenced later work by researchers at Princeton University, ETH Zurich, Massachusetts Institute of Technology, and Stanford University dealing with sparse graphs and spectral techniques pioneered in part by László Lovász and Fan Chung.

He introduced combinatorial configurations now cited in the literature alongside results from Béla Bollobás, Ronald Graham, and János Komlós, informing advances in probabilistic combinatorics and applications to extremal set theory linked to Erdős–Ko–Rado theorem contexts. His interplay with algebraic methods resonated with research by scholars at University of Cambridge and Imperial College London on eigenvalue interlacing and spectral graph theory, and his examples are used in pedagogy at institutions including Princeton University and University of California, Berkeley. Theorems bearing his influence appear in surveys by the European Mathematical Society and in curricula at Eötvös Loránd University.

His legacy includes a chain of students and collaborators who continued work on dichotomy results in sparse versus dense regimes, collaborations with mathematicians from Poland and Czech Republic rooted in meetings of the Mathematical Institute of the Hungarian Academy of Sciences, and influences on algorithmic aspects studied at Carnegie Mellon University and University of Toronto.

- Erdős, A.; coauthors. Papers on triangle-free graphs and chromatic bounds published in journals associated with the Hungarian Academy of Sciences and proceedings of the International Congress of Mathematicians. - Articles appearing alongside works by Paul Erdős and Alfréd Rényi in combinatorics-themed collections. - Monographs and survey chapters included in volumes edited by the American Mathematical Society and the European Mathematical Society addressing extremal problems and Ramsey theory.

He received recognition from the Hungarian Academy of Sciences and national prizes conferred in Hungary alongside awards historically associated with recipients like Pál Turán and Paul Erdős. He was invited to deliver lectures at the International Congress of Mathematicians and at seminars hosted by the Institute for Advanced Study and Max Planck Society, and held visiting appointments at institutions including Princeton University, University of Cambridge, and ETH Zurich.

Category:Hungarian mathematicians Category:Graph theorists Category:1935 births Category:2024 deaths