COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Combinatorics Seminar
Add to your list(s)
Send you e-mail reminders
Further detail
The Combinatorics Seminar normally meets at 2.30pm on Thursdays in Room MR12 , CMS. For further information contact Imre Leader or Andrew Thomason. These seminars appear also on the Combinatorics Seminar page of the DPMMS web site. If you have a question about this list, please contact: Andrew Thomason; HoD Secretary, DPMMS; crt43. If you have a question about a specific talk, click on that talk to find its organiser. 0 upcoming talks and 253 talks in the archive. Sparse minors in graphsMatthew Wales (University of Cambridge). MR12. Thursday 12 March 2020, 14:30-15:30 Rank-Based Independence Testing in Near Linear TimeChaim Even-Zohar (Turing Institute). MR12. Thursday 05 March 2020, 14:30-15:30 Hamilton cycles in highly symmetric graphsTorsten Mutze (University of Warwick). MR12. Thursday 20 February 2020, 14:30-15:30 Dense induced bipartite subgraphs in triangle-free graphsShoham Letzter (University of Cambridge). MR12. Thursday 13 February 2020, 14:30-15:30 Graphs with forbidden induced subgraphsAlex Scott (University of Oxford). MR12. Thursday 06 February 2020, 14:30-15:30 Inequalities on projected volumesZarko Randelovic (University of Cambridge). MR12. Thursday 30 January 2020, 14:30-15:30 Stable isoperimetry in lattice-like graphsBen Barber (University of Manchester). MR12. Thursday 23 January 2020, 14:30-15:30 Halfway to Rota's basis conjectureAlexey Pokrovskiy (Birkbeck, University of London). MR12. Thursday 05 December 2019, 14:30-15:30 Generalised Knight ToursNikolai Beluhov (Stara Zagora). MR12. Thursday 28 November 2019, 14:30-15:30 An approximate version of Jackson's conjectureYani Pehova (University of Warwick). MR12. Thursday 21 November 2019, 14:30-15:30 Intersection sizes of linear subspaces with the hypercubeCarla Groenland (University of Oxford). MR12. Thursday 07 November 2019, 14:30-15:30 The (non-)concentration of the chromatic numberOliver Riordan (University of Oxford). MR12. Thursday 31 October 2019, 14:30-15:30 Planar graphs: One graph to rule them allMarthe Bonamy (University of Bordeaux). MR12. Thursday 24 October 2019, 14:30-15:30 Cyclically Covering Subspaces in F 2 to the nJames Aaronson (University of Oxford). MR12. Thursday 17 October 2019, 14:30-15:30 Degree conditions forcing oriented cyclesAndrzej Grzesik (Jagiellonian University). MR12. Thursday 23 May 2019, 14:30-15:30 Monochromatic tight cycle partition for 3-graphsAllan Lo (University of Birmingham). MR12. Thursday 16 May 2019, 14:30-15:30 Successive shortest pathsStefanie Gerke (Royal Holloway UL). MR12. Thursday 02 May 2019, 14:30-15:30 The graph Moran processJohn Lapinskas (University of Oxford). MR12. Thursday 07 March 2019, 14:30-15:30 The Graham-Pollak Problem for HypergraphsImre Leader (University of Cambridge). MR12. Thursday 28 February 2019, 14:30-15:30 A stable arithmetic regularity lemma in finite abelian groupsCaroline Terry (University of Chicago). MR12. Thursday 14 February 2019, 14:30-15:30 Cycle-complete Ramsey numbersPeter Keevash (University of Oxford). MR12. Thursday 07 February 2019, 14:30-15:30 Analytic functions in Bernoulli percolationAgelos Georgakopoulos (University of Warwick). MR12. Thursday 31 January 2019, 14:30-15:30 The number of symbols that forces a transversalLiana Yepremyan (University of Oxford). MR12. Thursday 29 November 2018, 14:30-15:30 Colouring the real numbers and sum-sets with repetitionsDaniel Soukup (Universioty of Vienna). MR12. Thursday 22 November 2018, 16:00-17:00 Families of permutations with a forbidden intersectionDavid Ellis (Queen Mary UL). MR12. Thursday 22 November 2018, 14:30-15:30 Stability results for graphs containing a critical edgeAlexander Roberts (University of Oxford). MR12. Thursday 08 November 2018, 14:30-15:30 The largest K_s-free induced subgraph in a K_t-free graphOliver Janzer (University of Cambridge). MR12. Thursday 01 November 2018, 14:30-15:30 Nonstandard Methods in Ramsey TheoryMauro Di Nasso (University of Pisa). MR12. Thursday 25 October 2018, 14:30-15:30 Theorems of Caratheodory, Helly, and Tverberg without dimensionImre Bárány (UCL and Rényi Institute). MR12. Thursday 11 October 2018, 15:00-16:00 The Junta Method for HypergraphsNoam Lifschitz (Bar-Ilan University). MR13. Thursday 31 May 2018, 14:30-15:30 Complete Graphs with No Rainbow TreePeter Wagner (University of Rostock). MR13. Thursday 24 May 2018, 14:30-15:30 Sets of integers with many solutions to a linear equationJames Aaronson (University of Oxford). MR13. Thursday 17 May 2018, 14:30-15:30 Minimum saturated families of setsMatija Bucic (ETH Zurich). MR12. Thursday 03 May 2018, 16:00-17:00 Cross-intersecting familiesPeter Borg (University of Malta). MR12. Thursday 03 May 2018, 14:30-15:30 Graphons and Graphexes as Limits of Sparse Graphs: Part IIChristian Borgs (Microsoft Research New England). MR12. Thursday 05 April 2018, 15:30-16:30 Graphons and Graphexes as Limits of Sparse Graphs: Part IJennifer Chayes (Microsoft Research New England). MR12. Thursday 05 April 2018, 14:30-15:30 Polynomial configurations in sets of positive upper densityMohammad Bardestani (University of Cambridge). MR12. Thursday 08 March 2018, 14:30-15:30 Generalized sum-product phenomenon and group configurationsEmmanuel Breuillard (University of Cambridge). MR12. Thursday 01 March 2018, 14:30-15:30 Hypergraph Saturation IrregularitiesNatalie Behague (QMUL) . MR12. Thursday 22 February 2018, 14:30-15:30 Borel Local LemmaOleg Pikhurko (University of Warwick). MR12. Thursday 15 February 2018, 14:30-15:30 Hamilton spheres in 3-uniform hypergraphsJohn Haslegrave (University of Warwick). MR12. Thursday 01 February 2018, 14:30-15:30 How many irreducible polynomials are there with 0-1 coefficients?Peter Varju (University of Cambridge). MR12. Thursday 25 January 2018, 14:30-15:30 Maximising the number of induced cyclesNatasha Morrison (University of Cambridge). MR12. Thursday 30 November 2017, 14:30-15:30 Isoperimetry in integer latticesBen Barber (University of Bristol). MR12. Thursday 16 November 2017, 14:30-15:30 Fractional decompositions of dense graphsRichard Montgomery (University of Cambridge). MR12. Thursday 09 November 2017, 14:30-15:30 Embedding simply connected 2-complexes in 3-spaceJohannes Carmesin (University of Cambridge). MR12. Thursday 26 October 2017, 14:30-15:30 Long cycles in hamiltonian graphsAntónio Girão (University of Cambridge). MR12. Thursday 19 October 2017, 14:30-15:30 The Multicolour Ramsey Number of a Long Odd CycleJozef Skokan (LSE). MR12. Thursday 12 October 2017, 14:30-15:30 On the chromatic number of a sparse random hypergraphDmitry Shabanov (Moscow). MR12. Thursday 05 October 2017, 16:00-17:00 Elusive problems in extremal graph theoryDaniel Kráľ (University of Warwick). MR12. Thursday 01 June 2017, 14:30-15:30 Minimising the Number of TrianglesKatherine Staden (University of Warwick). MR12. Thursday 18 May 2017, 14:30-15:30 List colourings and preference ordersAndrew Thomason (University of Cambridge). MR12. Thursday 04 May 2017, 14:30-15:30 Tangles and the Mona LisaReinhard Diestel (University of Hamburg). MR12. Thursday 16 March 2017, 14:30-15:30 Ramsey problems in directed graphsShoham Letzter (ETH, Zurich). MR12. Thursday 09 March 2017, 14:30-15:30 Counting problems in additive combinatoricsJozsi Balogh (University of Illinois Urbana-Champaign). MR12. Thursday 02 March 2017, 14:30-15:30 Families with few k-chainsAdam Zsolt Wagner (University of Illinois Urbana-Champaign). MR12. Thursday 23 February 2017, 14:30-15:30 Highly connected subgraphs in sparse graphsHenry Liu (Central South University, China). MR12. Thursday 09 February 2017, 14:30-15:30 Monochromatic Infinite SumsetsPaul Russell (University of Cambridge). MR12. Thursday 02 February 2017, 14:30-15:30 Forbidden vector-valued intersectionsEoin Long (University of Oxford). MR12. Thursday 26 January 2017, 14:30-15:30 Tight Hamilton Cycles in 3-GraphsChristian Reiher (University of Hamburg). MR12. Thursday 01 December 2016, 14:30-15:30 Induced Subgraphs of Ramsey GraphsBhargav Narayanan (University of Cambridge). MR12. Thursday 24 November 2016, 14:30-15:30 Finite reflection groups and graph normsDavid Conlon (University of Oxford). MR12. Thursday 17 November 2016, 14:30-15:30 Essential Expansion is ForceableGabor Kun (Rényi Institute). MR5. Wednesday 16 November 2016, 14:30-15:30 Decomposing Complete HypergraphsLuka Milicevic (University of Cambridge). MR12. Thursday 10 November 2016, 14:30-15:30 Increasing Sequences of Integer TriplesJason Long (University of Cambridge). MR12. Thursday 27 October 2016, 14:30-15:30 Symmetric Intersecting Families of SetsDavid Ellis (QMUL). MR12. Thursday 20 October 2016, 14:30-15:30 Induced subgraphs of graphs with large chromatic numberAlex Scott (University of OXford). MR12. Thursday 13 October 2016, 14:30-15:30 A Stability Theorem for Maximal K_{r+1}-free graphsRichard Snyder (University of Memphis). MR12. Thursday 09 June 2016, 14:30-15:30 Sparse graph convergence and where it goesMiklós Abért (Rényi Institute). MR12. Thursday 02 June 2016, 16:00-17:00 Limits of some combinatorial problemsEndre Csóka (Rényi Institute). MR12. Thursday 02 June 2016, 14:30-15:30 Polychromatic colouring and cover-decomposition problems in the planeDömötör Pálvölgyi (University of Cambridge). MR12. Thursday 26 May 2016, 14:30-15:30 Extremal problems for cycles in graphsJacques Verstraëte (UCSD). MR12. Thursday 19 May 2016, 14:30-15:30 Exponential Patterns in Arithmetic Ramsey TheoryJulian Sahasrabudhe (University of Memphis). MR14. Tuesday 17 May 2016, 14:30-15:30 Noise sensitivity in bootstrap percolationGábor Pete (Renyi Institute and TU Budapest). MR12. Thursday 05 May 2016, 14:30-15:30 The Chromatic Number of Dense Random GraphsAnnika Heckel (University of Oxford). MR12. Thursday 28 April 2016, 14:30-15:30 Clique colourings of random graphsColin McDiarmid (University of Oxford). MR12. Thursday 10 March 2016, 14:30-15:30 Product mixing and product-free sets in the alternating groupSean Eberhard (University of Oxford). MR12. Thursday 03 March 2016, 14:30-15:30 Transitive Avoidance GamesMark Walters (Queen Mary London). MR12. Thursday 25 February 2016, 14:30-15:30 Achlioptas processes and truncated stochastic coalescenceLutz Warnke (University of Cambridge). MR12. Thursday 18 February 2016, 14:30-15:30 The sharp threshold for making squaresPaul Balister (University of Memphis). MR12. Thursday 11 February 2016, 14:30-15:30 Matchings in random bipartite graphsStefanie Gerke (Royal Holloway). MR12. Thursday 04 February 2016, 14:30-15:30 Additive triples of permutationsFreddie Manners (University of Oxford). MR12. Thursday 28 January 2016, 14:30-15:30 The multiplication table problem for bipartite graphsIstván Tomon (University of Cambridge). MR12. Thursday 21 January 2016, 14:30-15:30 Cutoff on all Ramanujan GraphsYuval Peres (Microsoft Research). MR12. Thursday 14 January 2016, 16:00-17:00 Measurable circle squaringOleg Pikhurko (University of Warwick). MR12. Thursday 03 December 2015, 14:30-15:30 A Concentration Inequality for Product SpacesKonstantinos Tyros (Warwick). MR12. Thursday 26 November 2015, 14:30-15:30 Edge-decompositions of graphs with high minimum degreeDaniela Kühn (Birmingham). MR12. Thursday 19 November 2015, 14:30-15:30 Tree-Decompositions of Infinite GraphsJohannes Carmesin (Cambridge). MR12. Thursday 12 November 2015, 14:30-15:30 Quantitative quasirandomnessBenny Sudakov (ETH Zurich). MR12. Thursday 05 November 2015, 14:30-15:30 Connectivity in graph classesGuillem Perarnau Llobet (Birmingham). MR12. Thursday 29 October 2015, 14:30-15:30 Bootstrap Percolation in the HypercubeNatasha Morrison (Oxford). MR12. Thursday 22 October 2015, 14:30-15:30 Clustering in preferential attachment networksLiudmila Ostroumova Prokhorenkova (Lomonosov Moscow State University). MR12. Thursday 11 June 2015, 14:30-15:30 A stability theorem for approximate representationsOmid Hatami (University of Cambridge). MR12. Thursday 04 June 2015, 14:30-15:30 Ramanujan Graphs and Finite Free Convolutions of PolynomialsDan Spielman (Yale University). MR14. Tuesday 02 June 2015, 14:30-15:30 A fat Szemerédi-Trotter theorem, and Inverse 2D Kakeya theoremsMichael Bateman (University of Cambridge). MR11. Thursday 28 May 2015, 14:30-15:30 Searching for hidden moving targets on graphsJohn Haslegrave (University of Sheffield). MR12. Thursday 21 May 2015, 14:30-15:30 Forbidden submatrices and forbidden subposetsAbhishek Methuku (Rényi Insitute). MR14. Tuesday 12 May 2015, 14:30-15:30 Edge-Decompositions of GraphsDaniela Kühn (University of Birmingham). MR12. Thursday 07 May 2015, 14:30-15:30 Birthday Inequalities, Hard Spheres, and Independent SetsWill Perkins (University of Birmingham). MR12. Thursday 30 April 2015, 14:30-15:30 Points in Almost General PositionLuka Milicevic (University of Cambridge). MR12. Thursday 12 March 2015, 14:30-15:30 Monochromatic cycle partitionsShoham Letzter (University of Cambridge). MR12. Thursday 05 March 2015, 14:30-15:30 Rigorous Analysis of a Randomised Number Field SieveJonathan Lee (University of Cambridge). MR12. Thursday 26 February 2015, 16:00-17:00 Maximal clades in random binary search treesSvante Janson (Uppsala University). MR12. Thursday 26 February 2015, 14:30-15:30 Decomposition of multiple coverings of the planeDömötör Pálvölgyi (Rényi Institute, Budapest). MR12. Thursday 19 February 2015, 16:00-17:00 The Ramsey Theory of OrdinalsThilo Weinert (Hebrew University of Jerusalem). MR12. Thursday 19 February 2015, 14:30-15:30 Cycles in Oriented 3-GraphsTa Sheng Tan (University of Malaya). MR12. Thursday 12 February 2015, 14:30-15:30 Tiling the GridVytautas Gruslys (University of Cambridge). MR12. Thursday 05 February 2015, 14:30-15:30 Colouring graphs with no odd holesAlex Scott (University of Oxford). MR12. Thursday 29 January 2015, 14:30-15:30 Coalescence on the Real LineBhargav Peruvemba Narayanan (University of Cambridge). MR12. Thursday 22 January 2015, 14:30-15:30 The number of maximal sum-free subsets of integersAndrew Treglown (University of Birmingham). MR12. Thursday 27 November 2014, 14:30-15:30 Balls-into-Bins via Local SearchThomas Sauerwald (University of Cambridge). MR12. Thursday 13 November 2014, 14:30-15:30 Fast wins in n-in-a-row gamesMark Walters (Queen Mary London). MR12. Thursday 06 November 2014, 14:30-15:30 Random graphs on the hyperbolic planeNikolaos Fountoulakis (University of Birmingham). MR12. Thursday 30 October 2014, 14:30-15:30 On Graphs Defined by Some Systems of EquationsFelix Lazebnik (University of Delaware). MR12. Thursday 23 October 2014, 14:30-15:30 Universality for critical cellular automata in d dimensionsPaul Smith (University of Cambridge). MR12. Thursday 16 October 2014, 14:30-15:30 Embedding spanning structures in random and pseudorandom graphsAsaf Ferber (ETH, Zurich). Centre for Mathematical Sciences, MR13. Thursday 12 June 2014, 14:00-15:00 A problem of Erdos and Sos on 3-graphsRoman Glebov (ETH, Zurich). Centre for Mathematical Sciences, MR13. Thursday 29 May 2014, 14:30-15:30 The Existence of DesignsPeter Keevash (University of Oxford). Centre for Mathematical Sciences, MR12. Thursday 22 May 2014, 14:30-15:30 The Chromatic Number of Random HypergraphsMartin Dyer (University of Leeds). Centre for Mathematical Sciences, MR12. Thursday 01 May 2014, 14:30-15:30 The Method of Typical Bounded DifferencesLutz Warnke (Cambridge). MR12. Thursday 13 March 2014, 14:30-15:30 Random Subgraphs of some Distance GraphsAndrei Raigorodskii (Moscow). Centre for Mathematical Sciences, MR4. Tuesday 11 March 2014, 14:30-15:30 Random Subgraphs of some Distance GraphsAndrei Raigorodskii (Moscow). Centre for Mathematical Sciences, MR4. Tuesday 11 March 2014, 14:30-15:30 Disjoint Subgraphs of the Same SizeBhargav Narayanan (Cambridge). MR12. Thursday 27 February 2014, 14:30-15:30 Exactly m-Coloured GraphsTeeradej Kittipassorn (Memphis). MR12. Thursday 20 February 2014, 14:30-15:30 Local Maxima of Quadratic Boolean FunctionsHunter Spink (Cambridge):. MR12. Thursday 06 February 2014, 14:30-15:30 The Ramsey Number of the Clique and the HypercubeSimon Griffiths (Oxford). MR12. Thursday 30 January 2014, 14:30-15:30 Frankl-Rodl-Type Theorems for Codes and PermutationsEoin Long (Oxford). MR12. Thursday 23 January 2014, 14:30-15:30 The minimum modulus of a covering system is at most 10^19Bob Hough (University of Cambridge). MR12. Thursday 05 December 2013, 14:30-15:30 Forbidden submatricesArès Méroueh (University of Cambridge). MR12. Thursday 28 November 2013, 14:30-15:30 Bounded gaps between primes: The latest developments from a combinatorial perspectiveAndrew Granville (Université de Montréal). MR12. Thursday 21 November 2013, 14:30-15:30 Decomposing the cube into pathsJosh Erde (University of Cambridge). MR12. Thursday 07 November 2013, 14:30-15:30 Orientations of Hypergraphs and Sparse Ramsey TheoryVytautas Gruslys (University of Cambridge). MR12. Thursday 31 October 2013, 14:30-15:30 Discrete Riemann mapping and the Poisson boundaryAgelos Georgakopoulos (University of Warwick). MR12. Thursday 17 October 2013, 14:30-15:30 Small minors and subdivisionsRichard Montgomery (University of Cambridge). MR12. Thursday 30 May 2013, 14:30-15:30 Sets of integers with no large sum-free subsetSean Eberhard (University of Cambridge). MR12. Thursday 23 May 2013, 14:30-15:30 Hitting Times for Maker-Breaker GamesDan Hefetz (University of Birmingham). MR12. Thursday 02 May 2013, 14:30-15:30 Juntas, stability and isoperimetric inequalities in the symmetric groupDavid Ellis (Queen Mary, UL). MR12. Thursday 07 March 2013, 14:30-15:30 Partition Regularity in the RationalsBen Barber (University of Cambridge). MR12. Thursday 28 February 2013, 14:30-15:30 Polynomial-time perfect matchings in dense hypergraphsFiachra Knox (Queen Mary UL). MR12. Thursday 21 February 2013, 14:30-15:30 Limits of Permutations: Forcing and TestingDan Král' (University of Warwick). MR12. Thursday 14 February 2013, 14:30-15:30 Proof of the 1-factorization and Hamilton decomposition conjecturesAllan Lo (University of Birmingham). MR12. Thursday 07 February 2013, 14:30-15:30 The Size of CapsetsMichael Bateman (University of Cambridge). MR12. Thursday 31 January 2013, 14:30-15:30 A measurable version of the Lovász Local LemmaGábor Kun (ELTE, Budapest). MR12. Thursday 24 January 2013, 14:30-15:30 Local algorithms on bounded degree graphsEndre Csóka (Rényi Institute and University of Warwick). MR12. Thursday 17 January 2013, 14:30-15:30 Partition Regularity in the Rationals (POSTPONED)Ben Barber (University of Cambridge). MR12. Thursday 29 November 2012, 14:30-15:30 Expansion in the group of affine transformationsPeter Varju (University of Cambridge). MR12. Thursday 22 November 2012, 14:30-15:30 Random graphs from a minor-closed classColin McDiarmid (University of Oxford). MR12. Thursday 15 November 2012, 14:30-15:30 Point-Line ProblemsBen Green (University of Cambridge). MR12. Thursday 01 November 2012, 14:30-15:30 How many real roots does a random matrix have?Van Vu (Yale University). MR12. Thursday 25 October 2012, 14:30-15:30 Partitioning coloured graphs into monochromatic cyclesAlexey Pokrovskiy (LSE). MR12. Thursday 18 October 2012, 14:30-15:30 Tiling Euclidean Space with Multiplicity by a PolytopeSinai Robins (Nanyang University, Singapore). MR12. Thursday 11 October 2012, 14:30-15:30 The phase transition in random graphs -- a simple proofBenny Sudakov (UCLA). MR12. Thursday 07 June 2012, 14:30-15:30 The Speed of Bootstrap PercolationPaul Smith (University of Cambridge). MR12. Thursday 31 May 2012, 14:30-15:30 Extremal graphs and graph limitsLászló Lóvász (Eötvös Loránd University). MR4. Friday 25 May 2012, 14:30-15:30 Large and Judicious Bisections of GraphsChoongbum Lee (UCLA). MR12. Thursday 10 May 2012, 14:30-15:30 Hamilton Cycles in Random Cayley GraphsDemetres Christofides (QMUL). MR12. Thursday 03 May 2012, 14:30-15:30 Possible Turán DensitiesOleg Pikhurko (University of Warwick). MR12. Thursday 08 March 2012, 14:30-15:30 Explosive Percolation is ContinuousLutz Warnke (University of Oxford). MR12. Thursday 01 March 2012, 14:30-15:30 Maximal percolation time in bootstrap percolationMichal Przykucki (University of Cambridge). MR12. Thursday 23 February 2012, 14:30-15:30 Bootstrap percolation with recoveryKaren Johannson (University of Memphis). MR12. Thursday 16 February 2012, 14:30-15:30 Analytical and Combinatorial Problems via ProbabilityJordan Stoyanov (University of Newcastle). MR12. Thursday 02 February 2012, 14:30-15:30 Solving S-Unit EquationsAdam Harper (University of Cambridge). MR12. Thursday 26 January 2012, 14:30-15:30 Tensors, colours, and octahedraImre Bárány (University College, London). MR12. Thursday 01 December 2011, 14:30-15:30 Euclidean Ramsey TheoryImre Leader (University of Cambridge). MR12. Thursday 24 November 2011, 14:30-15:30 Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximationYuval Peres (Microsoft Research). MR12. Thursday 03 November 2011, 14:30-15:30 Independent sets in hypergraphsWojciech Samotij (University of Cambridge). MR12. Thursday 27 October 2011, 14:30-15:30 Hypergraph containers and list colouringsDavid Saxton (University of Cambridge). MR12. Thursday 20 October 2011, 14:30-15:30 Well-quasi-ordering binary matroids (Aitken Lecture)Geoff Whittle (Victoria University of Wellington). MR12. Thursday 13 October 2011, 14:30-15:30 Convex chains among random points in the planeGergely Ambrus (Rényi Institute, Budapest). MR12. Thursday 09 June 2011, 14:30-15:30 Random Sorting NetworksAlexander Holroyd (Microsoft Research). MR14. Wednesday 08 June 2011, 14:30-15:30 Belief propagation guided decimation for random k-SATAmin Coja-Oghlan (University of Warwick). MR12. Thursday 02 June 2011, 14:30-15:30 Random Records and Cuttings in Split TreesCecilia Holmgren (Uppsala University). MR12. Thursday 12 May 2011, 14:30-15:30 New Bounds for the hard-core model on the square latticePrasad Tetali (Georgia Institute of Technology). MR4. Wednesday 11 May 2011, 14:30-15:30 Sets without arithmetic progressions, and patterns in arithmetic progressionsChristian Elsholtz (Graz). MR12. Thursday 05 May 2011, 14:30-15:30 Counterexamples to the Hirsch ConjectureFrancisco Santos (Cantabria). MR12. Thursday 17 March 2011, 15:00-16:00 Judicious partitions of hypergraphsJohn Haslegrave (University of Cambridge). MR12. Thursday 10 March 2011, 15:00-16:00 Convexity Spaces and Extremal Set TheoryBoris Bukh (University of Cambridge). MR12. Thursday 24 February 2011, 15:00-16:00 Triangle-Intersecting Families of GraphsDavid Ellis (St John's College, Cambridge). MR12. Thursday 10 February 2011, 15:00-16:00 An Approximate Form of Sidorenko's ConjectureDavid Conlon (St John's College, Cambridge). MR12. Thursday 03 February 2011, 15:00-16:00 On sumsets of convex setsJózsef Solymosi (University of British Columbia). MR12. Thursday 27 January 2011, 15:00-16:00 Matchings and packings in graphs, k-graphs and k-systemsRichard Mycroft (Queen Mary, London). MR12. Thursday 02 December 2010, 14:30-15:30 Codegree problems for 3-graphsEd Marchant (University of Cambridge). MR12. Thursday 25 November 2010, 14:30-15:30 Probably intersecting familiesPaul Russell (University of Cambridge). MR12. Thursday 18 November 2010, 14:30-15:30 Concrete Mathematical IncompletenessHarvey Friedman (Ohio State University). MR04. Monday 08 November 2010, 14:00-15:00 Hurricane Andrew strikes againRoland Häggkvist (University of Umeå). MR05. Friday 05 November 2010, 14:30-15:30 Graphs as Electrical NetworksRobert Johnson (Queen Mary, London). MR12. Thursday 04 November 2010, 14:30-15:30 Every Prime Number has Property BChristian Reiher (University of Rostock). MR12. Thursday 21 October 2010, 14:30-15:30 Recent results on the edit distance of graphsRyan Martin (Iowa State University). MR12. Thursday 14 October 2010, 14:30-15:30 Morphisms for Combinatorial OptimizationLarry Harper (UC Riverside). MR12. Friday 24 September 2010, 14:30-15:30 The density Hales-Jewett theorem (Part III)Tim Gowers (University of Cambridge). MR12. Tuesday 22 June 2010, 14:30-15:30 The density Hales-Jewett theorem (Part 2)Tim Gowers (Cambridge). MR12. Thursday 10 June 2010, 14:30-15:30 The density Hales-Jewett theorem (Part 1)Tim Gowers (Cambridge). MR12. Thursday 03 June 2010, 14:30-15:30 On 3N colored points in a planeGünther Ziegler (TU Berlin). MR12. Thursday 13 May 2010, 14:30-15:30 Hypergraphs do jumpRahil Baber (University College, London). MR12. Thursday 06 May 2010, 14:30-15:30 Long paths in subgraphs of the cubeEoin Long (University of Cambridge). MR4. Friday 30 April 2010, 14:30-15:30 Bootstrap percolation in two dimensions: recent progress and open problemsRob Morris (IMPA). MR12. Thursday 29 April 2010, 14:30-15:30 Analysing card shuffling via couplingArtur Czumaj (University of Warwick). MR12. Thursday 11 March 2010, 14:30-15:30 Expanders, Ramanujan graphs and random liftsBenny Sudakov (UCLA). MR12. Wednesday 10 March 2010, 14:30-15:30 Graph limits for threshold graphs and interval graphsSvante Janson (University of Uppsala). MR12. Thursday 25 February 2010, 14:30-15:30 Random partial orders and random linear extensionsGraham Brightwell (LSE). MR12. Thursday 18 February 2010, 14:30-15:30 A Sparse Regularity LemmaAlex Scott (University of Oxford). MR12. Thursday 11 February 2010, 14:30-15:30 Establishing Complexity of Problems Parameterized Above AverageGregory Gutin (Royal Holloway, University of London). MR12. Thursday 04 February 2010, 14:30-15:30 Newton's Method for Finding Roots of Complex Polynomials: Complex Dynamics Between Combinatorics and Numerical AnalysisDierk Schleicher (Jacobs University, Bremen). MR12. Thursday 28 January 2010, 14:30-15:30 Directed Simplices in Higher Order TournamentsTa Sheng Tan (University of Cambridge). MR12. Thursday 03 December 2009, 14:30-15:30 The maximal probability that k-wise independent bits are all 1Ariel Yadin (University of Cambridge). MR12. Thursday 26 November 2009, 14:30-15:30 Colliding PermutationsClaudia Malvenuto (University of Rome). MR12. Thursday 19 November 2009, 14:30-15:30 Lion and Man -- Can Both Win?Mark Walters (Queen Mary, London). MR12. Thursday 12 November 2009, 14:30-15:30 Strictly monotonic sequences in R^nDavid Saxton (University of Cambridge). MR12. Thursday 29 October 2009, 14:30-15:30 Approaching Kelly's ConjectureAndrew Treglown (University of Birmingham). MR12. Thursday 22 October 2009, 14:30-15:30 Tiling with TrianglesPeter Allen (University of Warwick). MR12. Thursday 15 October 2009, 14:30-15:30 Shadows and intersections: stability and new proofsPeter Keevash (Queen Mary London). MR12. Thursday 14 May 2009, 14:30-15:30 The structure of almost every graph in a hereditary propertyRob Morris (University of Cambridge). MR12. Thursday 07 May 2009, 14:30-15:30 How to choose the best twinsMichal Morayne (Wroclaw University of Technology). MR12. Thursday 05 March 2009, 14:30-15:30 Multigraphs with two weighted coloursEd Marchant (University of Cambridge). MR12. Thursday 26 February 2009, 14:30-15:30 Economical elimination of cycles in the torusNoga Alon. MR12. Thursday 12 February 2009, 14:30-15:30 Unfriendly PartitionsPhilipp Spruessel (University of Hamburg). MR12. Thursday 05 February 2009, 16:00-17:00 Random matrices: Universality of ESDs and the circular lawVan Vu (Rutgers University). MR12. Thursday 05 February 2009, 14:00-15:00 Differentiability in Null SetsMichael Dore (University of Warwick). MR12. Thursday 29 January 2009, 14:30-15:30 Expander graphs based on GRH and some cryptographic applicationsRamarathnam Venkatesan (Microsoft Research). MR11. Friday 16 January 2009, 12:00-13:00 Combinatorial theorems in sparse random setsTim Gowers (Cambridge). MR12. Thursday 04 December 2008, 14:30-15:30 A short story on summability, ideals, and stable Kneser hypergraphsTomasz Luczak (Adam Mickiewicz University). MR12. Thursday 27 November 2008, 14:30-15:30 The number of triangles in a graphAllan Lo (Cambridge). MR12. Thursday 20 November 2008, 14:30-15:30 Intersecting Families of PermutationsDavid Ellis (Cambridge). MR12. Thursday 13 November 2008, 14:30-15:30 Cycles in Oriented GraphsLuke Kelly (University of Birmingham). MR12. Thursday 06 November 2008, 14:30-15:30 Laplacians, homology and hypergraph matchingRoy Meshulam (Haifa). MR12. Thursday 23 October 2008, 14:30-15:30 Multivariate Pólya-Schur theory and applicationsJulius Borcea (Stockholm University). MR14. Thursday 19 June 2008, 14:30-15:30 A Quadratic Bound for Subset SumsMatt DeVos (Simon Fraser University). MR12. Thursday 12 June 2008, 14:30-15:30 Graphs in locally 2-connected spacesCarsten Thomassen (Technical University of Denmark). MR12. Thursday 29 May 2008, 14:30-15:30 On the existence of certain generalized quadranglesFelix Lazebnik (University of Delaware). MR12. Thursday 15 May 2008, 14:30-15:30 Inapproximability of the Tutte polynomialMark Jerrum (Queen Mary London). MR12. Thursday 08 May 2008, 14:30-15:30 Avoiding small subgraphs in Achlioptas processesMichael Krivelevich (Tel Aviv). MR12. Thursday 13 March 2008, 14:30-15:30 Cores, hulls and synchronizationPeter Cameron (Queen Mary and INI). MR12. Thursday 06 March 2008, 14:30-15:30 The combinatorics of moment calculationsnon-standard day and time Hugh Montgomery (Michigan). MR9. Friday 22 February 2008, 14:30-15:30 Generalizations of the Heilmann-Lieb Theorem -- with ProofsDavid Wagner (Waterloo). MR12. Thursday 14 February 2008, 14:30-15:30 A hypergraph regularity method for generalised Turán problemsPeter Keevash (Queen Mary, London). MR12. Thursday 24 January 2008, 14:30-15:30 Sampling convex bodies and random matrix theoryCombinatorics Seminar Alain Pajor ( Universite de Marne-la-Vallee). MR12. Thursday 15 November 2007, 14:30-15:30 Please see above for contact details for this list. |
Other listsGraduate Seminars PhD Colloquium - Dept of Architecture Chi Han WorkshopOther talksSpeak white, speak black, speak American Prof Kate Jones (UCL): Biodiversity & Conservation "Itsa me! Luigi!" [citation needed] - unlocking your referencing skills Surrogate models in Bayesian Inverse Problems ADMM for Exploiting Structure in MPC Problems A Bourdiesian analysis of songwriting habitus |