Prizes, Awards and Scholarships:
European Prize in Combinatorics, 2011
Recent Publications (from MathSciNet):
-
MR2989432 Pending Conlon, David; Fox, Jacob Bounds for graph regularity and removal lemmas.
Geom. Funct. Anal. 22 (2012), no. 5, 1191–1256. 05C80 (05C35)
-
MR2959395 Pending Conlon, David; Fox, Jacob; Sudakov, Benny Erdős–Hajnal-type theorems in hypergraphs.
J. Combin. Theory Ser. B 102 (2012), no. 5, 1142–1154. 05C65 (05C55)
-
MR2927637 Pending Conlon, David On the Ramsey multiplicity of complete graphs.
Combinatorica 32 (2012), no. 2, 171–186. 05C55 (05D10)
-
MR2864650 Reviewed Conlon, David; Hàn, Hiêp; Person, Yury; Schacht, Mathias Weak quasi-randomness for uniform hypergraphs.
Random Structures Algorithms 40 (2012), no. 1, 1–38. 05C80 (05C65)
-
MR2894450 Indexed Conlon, David Inevitable randomness in discrete mathematics [book review of
MR2543141].
Bull. Lond. Math. Soc. 43 (2011), no. 5, 1021–1023. 00A17
-
MR2773050 Reviewed Conlon, David; Fox, Jacob; Sudakov, Benny Large almost monochromatic subsets in hypergraphs.
Israel J. Math. 181 (2011), 423–432. (Reviewer: Mohit Kumbhat) 05D10 (05C15 05C55 05C65)
-
MR2738996 Reviewed Conlon, David; Fox, Jacob; Sudakov, Benny An approximate version of Sidorenko's conjecture.
Geom. Funct. Anal. 20 (2010), no. 6, 1354–1366. (Reviewer: József Balogh) 05D40 (05C30 05C35 05C80)
-
MR2679565 Reviewed Conlon, David An extremal theorem in the hypercube.
Electron. J. Combin. 17 (2010), no. 1, Research Paper 111, 7 pp. (Reviewer: Cheng-Kuan Lin) 05C35 (05C38 05D99)
More publications
