Hike around campus (meeting at the main entrance to the Mathematics Institute)

Update of 17 Sep: some parts of the hike were quite muddy this morning but there will be an option of taking a shortcut back to the central campus avoiding such parts :-)

Daniela Kühn (Birmingham)

Hypergraph F-designs exist for arbitrary F

Endre Csóka (Rényi)

Block partitions in higher dimensions

Andrei Raigorodskii (Moscow)

On the independence numbers and the chromatic numbers of random subgraphs

Tássio Naia (Birmingham)

Unavoidable trees in tournaments

Allan Lo (Birmingham)

Decomposing tournaments into paths

Padraig Condon (Birmingham)

Packing bounded degree trees into regular graphs

Matthew Coulson (Birmingham)

Rainbow matchings in Dirac graphs

Vadim Lozin (Warwick)

Specifying a positive threshold function via extremal points

Felix Joos (Birmingham)

Spanning trees in randomly perturbed graphs

Ben Barber (Bristol)

Isoperimetry in integer lattices

Stefan Glock (Birmingham)

The decomposition threshold of a given graph

Samuel Asefa Fufa (Addis Ababa)

On the Möbius function of a pointed graded lattice

Maryam Sharifzadeh (Warwick)

Proof of Komlós's conjecture on Hamiltonian subsets

Liana Yepremyan (Oxford)

Supersaturation of even cycles in linear hypergraphs

Zoltán Füredi (Rényi)

The extremal number for (a,b)-paths and other hypergraph trees

Mathias Schacht (Hamburg)

Homomorphism threshold for graphs

Łukasz Grabowski (Lancaster)

Borel and measurable versions of the Lovász Local Lemma

Hike to Kenilworth Castle (from the Mathematics Institute); alternatively, one can take taxi or bus no.11

Visit to Kenilworth Castle (NB: please be at the castle ticket office by 14:40 so that we can get the 15% group discount)

Also, Kenilworth Arts Festival, that takes place this week, may have events of interest.

Peter Keevash (Oxford)

Forbidden vector-valued intersections

Penny Haxell (Waterloo)

Stability and algorithms for independent transversals

Hong Liu (Warwick)

The minimum number of triangles in graphs of given order and size

BOWL Number Theory Meeting (if you'd like to attend all or a part of it, please register 13:00-13:15 on the day in Room B1.37)

Tibor Szabó (FU Berlin)

Exploring the projective normgraph

Julia Böttcher (LSE)

Packing degenerate graphs

Konstantinos Tyros (Koç)

Strong forms of stability

Andrew Treglown (Birmingham)

Tilings in graphs and directed graphs

Mark Yarrow (Sheffield)

Preferential attachment with weighted choice

Alberto Espuny Díaz (Birmingham)

Testing subgraph-freeness in general graphs

Robert Hancock (Birmingham)

Independent sets in hypergraphs and Ramsey properties of graphs and the integers

Richard Mycroft (Birmingham)

Triangle-tilings in graphs without large independent sets

Jan Corsten (LSE)

Diameter-Ramsey sets

Covering and tiling hypergraphs with tight cycles

Gal Kronenberg (Tel Aviv)

Chromatic index of random multigraphs

Abhishek Methuku (CEU)

On subgraphs of C_2k -free graphs and a question of Kühn and Osthus

Matthew Fitch (Warwick)

A variant of the Kruskal-Katona theorem

Ervin Győri (CEU)

On the number of edge-disjoint triangles in K₄ -free graphs

Jaehoon Kim (Birmingham)

Tree packing conjecture for bounded degree trees

Deryk Osthus (Birmingham)

A characterization of testable hypergraph properties

Daniel Král' (Warwick)

Elusive problems in extremal graph theory