We plan the following monothematic series of talks for the Spring School:

#### Differential equations method

Contact person: Jan Volec (volec-something_missing-kam.mff. …).

#### Combinatorial Nullstellensatz

Papers marked with **(*)** may be easier to understand and thus recommended for undergraduate students.

#### Cygan, Kowalik: Channel Assignment via Fast Zeta Transform (reserved: Vojta Tůma)

#### Alon, Mellinger, Mubayi, Verstraëte: The de Bruijn-Erdös Theorem for Hypergraphs

#### (*) Lin, Wolf: On subsets of F_q^n containing no k-term progressions (reserved: Veronika Bachratá)

#### (*) Pach, Tardos: Coloring axis-parallel rectangles

#### Wollan: Packing non-zero A-paths in an undirected model of group labeled graphs

#### Fox, Sudakov: Dependent Random Choice (reserved: Anita Liebenau, Roman Glebov)

#### Fomin, Saurabh, Thilikos: Strengthening Erdös-Pósa Property for Minor-Closed Graph Classes (reserved: Jana Hurajová)

#### (*) Faenza, Oriolo, Stauffer: An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

#### Liu, Pelsmajer: Dominating Sets in Triangulations on Surfaces (reserved: Katherine Edwards)

#### (*) Wulff-Nilsen: Min st-Cut of a Planar Graph in O(n \log\log n) Time (reserved: Mirek Klimoš)

#### Galvin: An upper bound for the number of independent sets in regular graphs (reserved: Gabriela Karafová)

#### Geelen, Whittle: The projective plane is a stabilizer (reserved: Codrut Grosu)

#### (*) Bessy, Thomassé: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (reserved: Matěj Klusáček)

#### Kochol: Smallest counterexample to the 5-flow conjecture has girth at least eleven(reserved: Robert Lukotka)

#### (*) Weimann, Yuster: Computing the Girth of a Planar Graph in O(N \LOG N) Time (reserved: Lukáš Lánský)

*If you have a problem with downloading some article, feel free to ask for a copy by email.*