Matches in DBpedia 2016-04 for { ?s ?p "David Conlon (born 1982) is an Irish mathematician. He earned a Ph.D. from Cambridge University in 2009; he is a fellow of Wadham College, Oxford and a lecturer in the department of mathematics at the University of Oxford. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.Conlon has worked in Ramsey theory. In particular, 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 that, for any bipartite graph H, random bipartite graphs have the fewest subgraphs isomorphic to H."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- David_Conlon abstract "David Conlon (born 1982) is an Irish mathematician. He earned a Ph.D. from Cambridge University in 2009; he is a fellow of Wadham College, Oxford and a lecturer in the department of mathematics at the University of Oxford. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.Conlon has worked in Ramsey theory. In particular, 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 that, for any bipartite graph H, random bipartite graphs have the fewest subgraphs isomorphic to H.".
- Q5232508 abstract "David Conlon (born 1982) is an Irish mathematician. He earned a Ph.D. from Cambridge University in 2009; he is a fellow of Wadham College, Oxford and a lecturer in the department of mathematics at the University of Oxford. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.Conlon has worked in Ramsey theory. In particular, 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 that, for any bipartite graph H, random bipartite graphs have the fewest subgraphs isomorphic to H.".