Jan Kratochvíl

Jan Kratochvíl
Name	Jan Kratochvíl
Birth date	1959
Birth place	Prague, Czechoslovakia
Nationality	Czech
Fields	Graph theory, Combinatorics, Computational complexity
Workplaces	Charles University, Masaryk University, Institute of Theoretical Computer Science
Alma mater	Charles University
Doctoral advisor	Jaroslav Nešetřil

Jan Kratochvíl is a Czech mathematician and computer scientist known for contributions to graph theory, combinatorics, and computational complexity. He has developed influential work on intersection graphs, graph colorings, and geometric representations that connects to problems in theoretical computer science and discrete mathematics. His career spans teaching and research appointments at prominent Central European institutions and extensive collaboration with international researchers.

Early life and education

Jan Kratochvíl was born in Prague and educated during the late Czechoslovak Socialist Republic, receiving early training influenced by Central European mathematical traditions associated with Charles University and the broader Czech school of discrete mathematics. He completed his undergraduate and graduate studies at Charles University, studying under supervisor Jaroslav Nešetřil, whose research group included work connected to Graph theory, Combinatorics, and the legacy of Paul Erdős. During his doctoral and postdoctoral formation he interacted with visiting scholars from institutions such as Masaryk University and research centers linked to the Czech Academy of Sciences, situating his development within networks that also included contacts with mathematicians from France, Germany, and Poland.

Academic career and positions

Kratochvíl held academic appointments at departments of mathematics and computer science of Czech universities, notably Charles University and Masaryk University, and served at research institutes affiliated with the Czech Academy of Sciences and the Institute of Theoretical Computer Science. He taught courses touching on subjects related to Graph theory, Algorithmic complexity, and discrete structures, supervising graduate students who later worked across European universities, including exchanges with groups at ETH Zurich, University of Oxford, University of Cambridge, and TU Berlin. His administrative roles included participation in program committees for conferences such as STOC, FOCS, SODA, and European events like Eurocomb and ICGT, and contributions to editorial boards of journals including Journal of Graph Theory and Discrete Mathematics.

Research contributions and areas of work

Kratochvíl's research program centers on structural and algorithmic aspects of graphs, with prominent results on intersection graph classes such as string graphs, segment intersection graphs, and disk graphs. He produced foundational complexity classifications showing NP-completeness and hardness for recognition problems of intersection graphs, connecting to decision problems studied at STOC and FOCS. His work on graph coloring and homomorphism problems interacts with classical themes originating from Kőnig and Brooks theorem while extending to constrained representations related to planar graphs, perfect graphs, and classes tied to geometric representations like unit disk graphs studied in the context of wireless networks and computational geometry.

Notable lines include characterizations of forbidden substructures for intersection classes and the introduction of reduction techniques used to prove intractability results parallel to frameworks developed by researchers at MIT, Princeton University, and University of Toronto. Kratochvíl collaborated on problems linking graph drawing and topological graph theory with researchers influenced by Paul Kainen and János Pach, contributing to the study of string graphs originally motivated by questions in topological graph theory and combinatorial geometry. He also worked on parameterized complexity aspects, interacting with methodological advances from groups associated with Max Planck Institute for Informatics and researchers advancing the W-hierarchy and fixed-parameter tractability.

Awards and honors

Kratochvíl received recognition from Czech and international bodies for his contributions to discrete mathematics and theoretical computer science. He was awarded national research prizes and grants from organizations such as the Czech Science Foundation and held fellowships facilitating collaboration with European centers including CNRS and institutes in Germany and France. His invited talks at major conferences such as ICM satellite workshops, Eurocomb, and plenaries at regional symposia reflect esteem within the graph theory community. Professional honors include membership and leadership roles in Czech scientific societies and editorial responsibilities at journals connected to Elsevier and Springer, aligning him with prominent figures who have shaped modern Combinatorics and Theoretical Computer Science.

Selected publications and legacy

Kratochvíl authored and co-authored numerous papers and book chapters addressing intersection graphs, recognition complexity, and geometric representations. Selected works appeared in journals like Journal of Graph Theory, SIAM Journal on Discrete Mathematics, and conference proceedings of STOC and SoCG. His publications often built on and informed research streams initiated by Erdős-era combinatorialists and modern theoreticians at institutions such as Cornell University, Harvard University, and University of Illinois Urbana–Champaign. Through PhD supervision and collaborations, his intellectual lineage connects to students and coauthors who joined faculties across Europe and North America, perpetuating research on string graphs, disk graphs, and algorithmic complexity.

Kratochvíl's legacy is evident in persistent open problems he formulated and in techniques he introduced for reductions and structural decompositions that continue to be employed by researchers working on intersection graph recognition, parameterized algorithms, and geometric graph representations. His influence is recorded in citations and in the sustained relevance of problems he studied at venues like Eurocomb, SoCG, and regional combinatorics workshops, maintaining ties to ongoing developments in Discrete Geometry, Topological Graph Theory, and Computational Complexity.

Category:Czech mathematicians Category:Graph theorists