## Combinatorics and Probability Seminar
Add to your list(s)
Send you e-mail reminders
Further detail
Weekly seminar on Combinatorics and Probability. Every Thursday at 15 at Watson-LTB during Autumn 2019 term. (Exceptions may apply.) 1 upcoming talk and ## TBAVincent Pfenninger (University of Birmingham). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 26 November 2020, 16:00-17:00 ## Extremal stationary values for random digraphsGuillem Perarnau (Polytechnic University of Catalonia). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 19 November 2020, 16:00-17:00 ## The threshold for the square of a Hamilton cycleJinyoung Park (Institute for Advanced Study). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 12 November 2020, 16:00-17:00 ## Combinatorial discrepancy and harmonic analysisJulian Sahasrabudhe (University of Cambridge). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 05 November 2020, 16:00-17:00 ## Algorithmic Aspects of The Lovász Local LemmaFotis Iliopoulos (Institute for Advanced Study). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 29 October 2020, 16:00-17:00 ## Roots of random polynomials near the unit circleMarcus Michelen (University of Illinois at Chicago). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 22 October 2020, 16:00-17:00 ## Ryser's conjecture and moreLiana Yepremyan (University of Illinois at Chicago). https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09. Thursday 15 October 2020, 16:00-17:00 ## On Hamilton cycles in highly symmetric graphsTorsten Mütze (University of Warwick). https://bham-ac-uk.zoom.us/j/87298164024?pwd=WWJBM3pKWWdGU1lucEJZZk8rbjBXQT09. Thursday 08 October 2020, 16:00-17:00 ## Best Response Dynamics on Random GraphsJordan Chellig (University of Birmingham). https://bham-ac-uk.zoom.us/j/94911365006?pwd=RGNmWlYvY2NPUmFpKzFoRUpvY1lEUT09. Thursday 01 October 2020, 16:00-17:00 ## Combinatorial discrepancy and a problem of J.E. Littlewood on Flat PolynomialsJulian Sahasrabudhe (University of Cambridge+. Thursday 12 March 2020, 15:00-16:00 ## A proof of Ringel's conjectureAlexey Pokrovskiy (Birkbeck College, University of London). Thursday 27 February 2020, 15:00-16:00 ## Iterated product sets with shiftsOliver Roche-Newton (RICAM, Austria). Thursday 20 February 2020, 15:00-16:00 ## Extremal problems of long cycles in random graphsGal Kronenberg (University of Oxford). Thursday 13 February 2020, 15:00-16:00 ## Counting Hamilton cycles in Dirac hypergraphsStephen Gould (University of Birmingham). Thursday 06 February 2020, 15:00-16:00 ## The Typical Structure of Sets with Small SumsetNatasha Morrison (University of Cambridge). Thursday 30 January 2020, 15:00-16:00 ## Homomorphisms from the torusMatthew Jenssen (University of Birmingham). Thursday 23 January 2020, 15:00-16:00 ## Sampling sufficiency for determining modularity.Fiona Skerman (University of Bristol). Thursday 16 January 2020, 15:00-16:00 ## Distinct degrees in induced subgraphsEoin Long (University of Birmingham). Thursday 12 December 2019, 14:00-15:00 ## The Erdős Sumset ConjectureJoel Moreira (University of Warwick). Thursday 05 December 2019, 14:00-15:00 ## Nonlinear problems in arithmetic Ramsey theorySean Prendiville (Lancaster University). Thursday 21 November 2019, 14:00-15:00 ## A degree sequence Komlós theoremJoseph Hyde (University of Birmingham). Thursday 14 November 2019, 14:00-15:00 ## On the number of discrete chains in the planeNóra Frankl (LSE). Thursday 07 November 2019, 14:00-15:00 ## On the density of critical graphs without large cliquesTom Kelly (University of Birmingham). Thursday 31 October 2019, 14:00-15:00 ## Partial associativity in Latin squaresJason Long (University of Oxford). Thursday 24 October 2019, 14:00-15:00 ## Path and cycle decompositions of dense graphsBertille Granet (University of Birmingham). Thursday 17 October 2019, 14:00-15:00 ## The extremal number of subdivisionsOliver Janzer (University of Cambridge). Thursday 10 October 2019, 14:00-15:00 ## Sharp thresholds for sparse functions with applications to extremal combinatoricsNoam Lifshitz (Hebrew University). Thursday 03 October 2019, 14:00-15:00 ## Spanning cycles in random directed graphs.Richard Montgomery, University of Birmingham. Wednesday 19 June 2019, 15:00-16:00 ## Dynamical Models of Random Simplicial ComplexesTejas Iyer, University of Birmingham. Wednesday 05 June 2019, 15:00-16:00 ## Tilings in randomly perturbed graphs: bridging the gap between Hajnal--Szemer\'edi and Johansson--Kahn--VuPatrick Morris, University of Berlin (FU). Monday 29 April 2019, 15:00-16:00 ## Sharp bounds for decomposing graphs into edges and trianglesYanitsa Pehova (University of Warwick). Thursday 28 March 2019, 13:00-14:00 ## Some open questionsJohannes Carmesin (University of Birmingham). Thursday 21 March 2019, 13:00-14:00 ## Cycles of length three and four in tournamentsJon Noel (University of Warwick). Thursday 14 March 2019, 13:00-14:00 ## Stability results for graphs containing a critical edgeAlex Roberts (University of Oxford). Thursday 28 February 2019, 13:00-14:00 ## Parking on the integersMichał Przykucki (University of Birmingham). Thursday 21 February 2019, 13:00-14:00 ## Rational Turan exponentsJaehoon Kim (University of Warwick). Thursday 07 February 2019, 13:00-14:00 ## Counting hypergraph colorings in the local lemma regimeHeng Guo (University of Edinburgh). Thursday 31 January 2019, 13:00-14:00 ## Colouring dense random graphs - when can we use the second moment method?Annika Heckel (University of Oxford). Thursday 24 January 2019, 13:00-14:00 ## Highly linked tournamentsAntónio Girão (University of Birmingham). Thursday 17 January 2019, 13:00-14:00 ## Resilient degree sequences with respect to Hamiltonicity in random graphsAlberto Espuny, University of Birmingham. Thursday 13 December 2018, 15:00-16:00 ## Dynamic monopolies and degenerate setsStefan Ehard, University of Ulm. Thursday 22 November 2018, 15:00-16:00 ## Counting delta-matroidsSteve Noble, Birkbeck, University of London. Thursday 15 November 2018, 15:00-16:00 ## Branching Brownian motion with decay of massSarah Penington, University of Bath. Thursday 08 November 2018, 15:00-16:00 ## Analytic functions in Bernoulli percolationAgelos Georgakopoulos, University of Warwick. Thursday 01 November 2018, 15:00-16:00 ## Induced trees and Erdos-HajnalAlex Scott, University of Oxford. Thursday 25 October 2018, 15:00-16:00 ## An isoperimetric approach to some Erdos-Ko-Rado type problemsDavid Ellis (QMUL). Tuesday 09 October 2018, 15:00-16:00 ## Scaling limits of Markov Branching TreesRobin Stephenson, University of Oxford. Thursday 04 October 2018, 15:00-16:00 ## Online graph coloring with bichromatic exchangesMarc Heinrich (Université Lyon 1). Wednesday 13 June 2018, 15:00-16:00 ## Colouring triangle-free graphs with few coloursAnton Bernshteyn (University of Illinois at Urbana-Champaign). Wednesday 30 May 2018, 15:00-16:00 ## The Junta Method for HypergraphsNoam Lifshitz (Bar Ilan University). Thursday 17 May 2018, 15:00-16:00 ## Edge correlations in random regular hypergraphsAlberto Espuny (University of Birmingham). Wednesday 02 May 2018, 15:00-16:00 ## Shotgun Assembly of the HypercubeMichal Przykucki (University of Oxford). Tuesday 20 March 2018, 15:00-16:00 ## The size of the giant component in random hypergraphs: a short proofChristoph Koch (University of Oxford). Tuesday 13 March 2018, 15:00-16:00 ## A bandwidth theorem for approximate decompositionsPadraig Condon (University of Birmingham). Tuesday 27 February 2018, 15:00-16:00 ## The minimum number of triangles in a graph of given order and sizeKatherine Staden (University of Oxford). Tuesday 20 February 2018, 15:00-16:00 ## Scaling limits of critical inhomogeneous random graphsMinmin Wang (University of Bath). Tuesday 13 February 2018, 15:00-16:00 ## Rainbow spanning subgraphs of graphs with large minimum degreeMatthew Coulson (University of Birmingham). Tuesday 06 February 2018, 15:00-16:00 ## Bounding the cop-number of a graph in terms of its genusFlorian Lehner (University of Warwick). Tuesday 30 January 2018, 15:00-16:00 ## A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman ProblemLazlo Vegh (LSE). Tuesday 23 January 2018, 15:00-16:00 ## Self-avoiding walk in ∞ + 1 dimensionsTom Hutchcroft (University of Cambridge). Tuesday 16 January 2018, 15:00-16:00 ## The trophic structure of directed graphsSamuel Johnson (University of Birmingham). Tuesday 09 January 2018, 15:00-16:00 ## Intersecting familiesAndrey Kupavskii (University of Birmingham). Tuesday 05 December 2017, 15:00-16:00 ## Two problems in extremal graph theoryTaisa Martins (University of Warwick). Tuesday 28 November 2017, 15:00-16:00 ## Measure-valued Pólya processesCécile Mailler (University of Bath). Tuesday 21 November 2017, 15:00-16:00 ## Exploiting structure in sets of frequenciesThomas Bloom (University of Bristol). Tuesday 14 November 2017, 15:00-16:00 ## Correspondence Coloring and its ApplicationsLuke Postle (University of Waterloo). Friday 10 November 2017, 14:00-15:00 ## Extremal Cuts and Isoperimetry in Random Cubic GraphsGregory Sorkin (London School of Economics). Tuesday 07 November 2017, 15:00-16:00 ## On some recent applications of the polynomial methodPeter Pach (University of Warwick). Tuesday 31 October 2017, 15:00-16:00 ## Contagious sets in a degree-proportional bootstrap percolation processFred Garbe (University of Birmingham). Tuesday 24 October 2017, 15:00-16:00 ## Exceptional times of the critical Erdős-Rényi graphMatt Roberts (University of Bath). Tuesday 17 October 2017, 15:00-16:00 ## On the List Coloring Version of Reed's ConjectureMichelle Delcourt (University of Birmingham). Tuesday 10 October 2017, 15:00-16:00 ## Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of n-leaf Galton-Watson treesMatthias Winkel (University of Oxford). Tuesday 03 October 2017, 15:00-16:00 ## Conjectures in spectral graph theoryClive Elphick (University of Birmingham). Tuesday 26 September 2017, 15:00-16:00 ## Inversions in random node labeling of random treesXing Shi Cai (Uppsala University). Thursday 27 July 2017, 15:00-16:00 ## Domination in structured tournamentsNicolas Bousquet (CNRS, Grenoble). Thursday 01 June 2017, 15:00-16:00 ## Degree versions of some classical results in Extremal CombinatoricsHao Huang (Emory University). Monday 15 May 2017, 15:00-16:00 ## Covering and tiling hypergraphs with tight cyclesNicolás Sanhueza-Matamala (Birmingham). Thursday 23 March 2017, 15:00-16:00 ## Edges not in any monochromatic copy of a fixed graphMaryam Sharifzadeh (Warwick). Thursday 16 March 2017, 15:00-16:00 ## Monochromatic Cycle PartitioningRichard Lang (Universidad de Chile). Thursday 23 February 2017, 15:00-16:00 ## Branchings in Digraphs: Structural Results and AlgorithmsGregory Gutin (Royal Holloway). Thursday 09 February 2017, 15:00-16:00 ## Mathematics Colloquium: Containers in CombinatoricsAndrew Thomason (Cambridge). Wednesday 08 February 2017, 16:00-17:00 ## Galton-Watson trees and Apollonian networksHenning Sulzbach (Birmingham). Thursday 26 January 2017, 15:00-16:00 ## Homological connectivity of random hypergraphsMihyun Kang (Graz). Thursday 19 January 2017, 15:00-16:00 ## Generalised Colouring Numbers of GraphsJan van den Heuvel (LSE). Thursday 12 January 2017, 15:00-16:00 ## Minimum number of edges that occur in odd cyclesAndrzej Grzesik (Jagiellonian University/University of Warsaw) . Thursday 08 December 2016, 15:00-16:00 ## Counting extensions in random graphsLutz Warnke (Cambridge University) . Thursday 01 December 2016, 15:00-16:00 ## Large deviations in random graphsYufei Zhao (University of Oxford). Thursday 24 November 2016, 15:00-16:00 ## Forbidden vector-valued intersectionsEoin Long (Tel Aviv University/University of Oxford) . Thursday 17 November 2016, 15:00-16:00 ## Finite reflection groups and graph normsJoonkyung Lee (University of Oxford). Thursday 10 November 2016, 15:00-16:00 ## Random walk on dynamical percolationPerla Sousi (Cambridge University). Thursday 03 November 2016, 15:00-16:00 ## Computability and Finite Forcibility of Graph LimitsJake Cooper (University of Warwick). Thursday 27 October 2016, 15:00-16:00 ## Hereditary quasirandomness without regularityDavid Conlon (University of Oxford). Thursday 20 October 2016, 15:00-16:00 ## Scaling limits of critical random trees and graphs.Christina Goldschmidt (University of Oxford). Thursday 13 October 2016, 15:00-16:00 ## Subdivisions in C_4-free graphs.Richard Montgomery (Cambridge University). Thursday 06 October 2016, 15:00-16:00 ## On the number of cycles covering distinct vertex sets.Jaehoon Kim (University of Birmingham). Thursday 29 September 2016, 15:00-16:00 If you have a question about this list, please contact: Dr Andrew Treglown; Allan Lo; Richard Montgomery; Johannes Carmesin; Eoin Long; M.Jenssen. If you have a question about a specific talk, click on that talk to find its organiser. |
## Other listsTheoretical Physics Journal Club Birmingham and Warwick Algebra Seminar Computer Science Distinguished Seminars## Other talksRoute to Hyperspectral Terahertz Microscopy via Nonlinear Ghost-Imaging An Introduction to Quasi-graphic matroids Exploring non-equilibrium dynamics in novel Fermi gas systems Topology and Dynamics of Intracellular Networks for Cellular Decision Making |