Kazimierz Zarankiewicz

Kazimierz Zarankiewicz
Name	Kazimierz Zarankiewicz
Birth date	1902
Death date	1959
Nationality	Polish
Fields	Mathematics
Alma mater	University of Warsaw
Known for	Zarankiewicz problem, extremal graph theory

Kazimierz Zarankiewicz was a Polish mathematician noted for work in combinatorics, graph theory, and topology. He is best remembered for posing the Zarankiewicz problem in extremal graph theory and for contributions that influenced later developments in Paul Erdős–style combinatorics, connections with Steinhaus problems, and applications to probability theory and functional analysis. His career spanned interwar Poland and postwar reconstruction, interacting with institutions and figures across Warsaw, Lviv, and Paris.

Early life and education

Zarankiewicz was born in the early 20th century in the partitioned lands of Congress Poland under the Russian Empire and grew up amid the cultural milieu of Warsaw. He studied mathematics at the University of Warsaw where he encountered professors associated with the Lwów School of Mathematics and the contemporaneous mathematical circles that included Stefan Banach, Hugo Steinhaus, Wacław Sierpiński, and Otton Nikodym. During his formative years he participated in seminars and colloquia that also attracted figures from Jagiellonian University, Warsaw University of Technology, and visiting scholars from France and Germany such as Émile Borel and David Hilbert-influenced analysts.

Academic career

Zarankiewicz held positions at Polish institutions during the volatile interwar period, including appointments that linked him to the University of Warsaw and collaborations with members of the Polish Mathematical Society. During World War II and the occupation he maintained contacts with clandestine academic networks and colleagues associated with the Underground University of Warsaw and émigré scholars who later reached United Kingdom and United States academic centers. In the postwar era he contributed to rebuilding Polish mathematical life, engaging with institutions such as the Polish Academy of Sciences and cooperating with mathematicians who emigrated to Israel, Canada, and France, thereby influencing transnational mathematical exchange involving figures like Paul Erdős, Alfréd Rényi, and John von Neumann.

Contributions to mathematics

Zarankiewicz formulated what became known as the Zarankiewicz problem, a foundational question in extremal graph theory concerning the maximum number of edges in a bipartite graph on given numbers of vertices that avoids a complete bipartite subgraph K_{s,t}. This problem links directly to work by Turán on extremal problems, to the probabilistic methods advanced by Paul Erdős and Alfréd Rényi, and to later developments by Václav Chvátal, Miklós Simonovits, and Péter Frankl. His investigations intersected with topics in incidence geometry and combinatorial design, connecting to results by Erdős–Ko–Rado collaborators and to applications in finite geometry such as problems involving projective planes and affine planes. Zarankiewicz also worked on planar graph embeddings, drawing upon classical results of Kuratowski and later informing algorithmic graph theory studied by researchers at Stanford University and Princeton University. His questions influenced spectral graph theory research by mathematicians like Alfredo Hubáček and linked to extremal set theory studied by Issai Schur-school descendants. The Zarankiewicz problem stimulated bounds using probabilistic, algebraic, and number-theoretic techniques developed by successors including Endre Szemerédi, László Lovász, Noga Alon, and János Komlós.

Selected publications

- Paper presenting the Zarankiewicz problem and initial bounds, published in Polish mathematical journals with circulation among the Polish Mathematical Society readership and cited by contemporaries such as Paul Erdős and Hugo Steinhaus. - Articles on bipartite extremal problems and planar graph properties circulated in interwar and postwar European proceedings alongside work by Wacław Sierpiński and Stefan Banach. - Notes and communications to international conferences attended by delegates from France and Germany, where results were compared with those of Tibor Radó and Kazimierz Kuratowski.

Awards and recognition

During his lifetime Zarankiewicz received recognition within Polish academic circles and was acknowledged by members of the Polish Academy of Sciences and the Polish Mathematical Society. His problem became a standard reference in combinatorics courses and was cited in surveys by figures such as Paul Erdős, Ronald Graham, and László Lovász. Posthumously, his name endures through the Zarankiewicz problem appearing in textbooks used at institutions like Harvard University, University of Cambridge, Massachusetts Institute of Technology, and in monographs authored by Béla Bollobás and János Komlós.

Legacy and influence

Zarankiewicz's legacy is the sustained study of extremal configurations in graphs and combinatorial geometry, influencing generations including Paul Erdős, Alfréd Rényi, Béla Bollobás, Ronald Graham, Endre Szemerédi, Noga Alon, and László Lovász. The Zarankiewicz problem catalyzed research programs in extremal graph theory, probabilistic combinatorics, and discrete geometry at centers such as Institute for Advanced Study, University of Cambridge, Steklov Institute of Mathematics, and the Courant Institute of Mathematical Sciences. Contemporary work in combinatorics, additive number theory, and theoretical computer science continues to build on the questions he posed, with modern approaches drawing on techniques from spectral graph theory, algebraic geometry, and analytic number theory. His contributions are commemorated in courses, seminars, and problem lists maintained by societies including the European Mathematical Society and the American Mathematical Society.

Category:Polish mathematicians Category:Combinatorialists Category:Graph theorists