Imre Leader | |
|---|---|
 | |
| Born | 30 October 1963 |
| Alma mater | Cambridge University |
| Awards | Whitehead Prize (1999) |
| Scientific career | |
| Fields | Combinatorics |
| Thesis | Discrete Isoperimetric Inequalities and Other Combinatorial Results (1989) |
| Doctoral advisor | Béla Bollobás |
Imre Bennett Leader (born 30 October 1963) is a British mathematician, a professor in DPMMS at the University of Cambridge working in the field of combinatorics. He is also known as an Othello player.
He is the son of the physicist Elliot Leader and his first wife Ninon Neményi (his mother was previously married to the poet Endre Kövesi); Darian Leader is his brother. [1] Imre Lakatos was a family friend and his godfather. [2]
Leader was educated at St Paul's School in London, from 1976 to 1980. [3] He won a silver medal on the British team at the 1981 International Mathematical Olympiad (IMO) for pre-undergraduates. [4] He later acted as the official leader of the British IMO team, taking over from Adam McBride in 1999, to 2001. [5] [6] [7] He was the IMO's Chief Coordinator and Problems Group Chairman in 2002. [8]
Leader went on to Trinity College, Cambridge, where he graduated B.A. in 1984, M.A. in 1989, and Ph.D. in 1989. [9] His Ph.D. was in mathematics was for work on combinatorics, supervised by Béla Bollobás. [10] From 1989 to 1996 he was Fellow at Peterhouse, Cambridge, then was Reader at University College London from 1996 to 2000. He was a lecturer at Cambridge from 2000 to 2002, and Reader there from 2002 to 2005. [7] In 2000 he became a Fellow of Trinity College. [11]
In 1999 Leader was awarded a Junior Whitehead Prize for his contributions to combinatorics. Cited results included the proof, with Reinhard Diestel, of the bounded graph conjecture of Rudolf Halin. [12] [13]
Leader in an interview in 2016 stated that he began to play Othello in 1981, with his friend Jeremy Rickard. [14] In the years from 1982 and 2022 he was 16 times the British Othello champion. [15] In 1983 he came second in the world individual championship, and in 1988 he played on the British team that won the world team championship. [16]
As of 2024, Leader has won the European Grand Prix Championship six times, most recently in 2023. [17]
Sir William Timothy Gowers, is a British mathematician. He is Professeur titulaire of the Combinatorics chair at the Collège de France, and director of research at the University of Cambridge and Fellow of Trinity College, Cambridge. In 1998, he received the Fields Medal for research connecting the fields of functional analysis and combinatorics.
Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative connections between various graph properties, both global and local, and problems in extremal graph theory can often be formulated as optimization problems: how big or small a parameter of a graph can be, given some constraints that the graph has to satisfy? A graph that is an optimal solution to such an optimization problem is called an extremal graph, and extremal graphs are important objects of study in extremal graph theory.
In the mathematical field of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped to non-edges. A graph is a vertex-transitive graph if, given any two vertices v1 and v2 of G, there is an automorphism f such that
Béla Bollobás FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős from the age of 14.
László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.
Ben Joseph Green FRS is a British mathematician, specialising in combinatorics and number theory. He is the Waynflete Professor of Pure Mathematics at the University of Oxford.
In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning k-regular subgraph, and a k-factorization partitions the edges of the graph into disjoint k-factors. A graph G is said to be k-factorable if it admits a k-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a k-regular graph is a proper edge coloring with k colors. A 2-factor is a collection of cycles that spans all vertices of the graph.
Geoffrey Charles Smith, MBE is a British mathematician. He is Senior Lecturer in Mathematics at the University of Bath and current professor in residence at Wells Cathedral School.
Imre Bárány is a Hungarian mathematician, working in combinatorics and discrete geometry. He works at the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and has a part-time appointment at University College London.
Norman Linstead Biggs is a leading British mathematician focusing on discrete mathematics and in particular algebraic combinatorics.
Graham Brightwell is a British mathematician working in the field of discrete mathematics.
David Conlon is an Irish mathematician who is a Professor of Mathematics at the California Institute of Technology. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics. He proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers. He won the European Prize in Combinatorics in 2011 for his work in Ramsey theory and for his progress on Sidorenko's conjecture, and the Whitehead Prize in 2019.
Daniela Kühn is a German mathematician and the Mason Professor in Mathematics at the University of Birmingham in Birmingham, England. She is known for her research in combinatorics, and particularly in extremal combinatorics and graph theory.
In graph theory, a branch of mathematics, Fleischner's theorem gives a sufficient condition for a graph to contain a Hamiltonian cycle. It states that, if is a 2-vertex-connected graph, then the square of is Hamiltonian. It is named after Herbert Fleischner, who published its proof in 1974.
Peter Keevash is a British mathematician, working in combinatorics. He is a professor of mathematics at the University of Oxford and a Fellow of Mansfield College.
Zdeněk Dvořák is a Czech mathematician specializing in graph theory.
Daniel Kráľ is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the Masaryk University. His research primarily concerns graph theory and graph algorithms.
Wojciech Samotij is a Polish mathematician and a full professor at the School of Mathematical Sciences at the Tel Aviv University. He is known for his work in combinatorics, additive number theory, Ramsey theory and graph theory.
Po-Shen Loh is an American mathematician specializing in combinatorics. Loh teaches at Carnegie Mellon University, and from 2014 to 2023 served as the national coach of the United States' International Mathematical Olympiad team. He is the founder of educational websites Expii and Live, and lead developer of contact-tracing app NOVID.
The Singapore Mathematical Society is the primary organization "representing and advancing the interests of the mathematical community in Singapore".
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
 | This article about a United Kingdom mathematician is a stub. You can help Wikipedia by expanding it. |
