Aktuelles

16.07.2024, 15:00 Uhr, C 325, Martin Dietzfelbinger (TU Ilmenau)
Zum sogenannten Paradox der überraschenden Prüfung

09.07.2024, 15:00 Uhr, C 325, Thomas Böhme (TU Ilmenau)
Word embeddings

20.06.2024, 11:30 Uhr, C 325, Maximilian Krone (TU Ilmenau)
Schnitt-Überdeckungen in azyklischen Digraphen

07.05.2024, 15:00 Uhr, C 325, Lucas Picasarri-Arieta (Universität Cote d'Azur)
Colouring and recolouring digraphs with bounded maximum degree

25.04.2024, 11:00 Uhr, C 325, Veronica Requena (Universidad de Alicante)

31.01.2024, 15:00 Uhr, C 325, Jochen Harant (TU Ilmenau)
Spanning trees with bounded degrees of vertices in a specied independent set

29.06.2023, 17:00 Uhr, Curie-Hörsaal, Tibor Szabó (Freie Universität Berlin)
Topology at the North Pole

28.06.2023, 15:00 Uhr, Vincent Pfenninger (University of Birmingham)
Perfect matchings in random sparsifications of Dirac hypergraphs

21.06.2023, 15:00 Uhr, Lyuben Lichev (Université Jean Monnet)
The clique chromatic number of random graphs

14.06.2023, 15:00 Uhr, Ingo Schiermeyer (Technische Universität Bergakademie Freiberg)
3-colourability and diamonds

31.05.2023, 15:00 Uhr, Arturo Merino (Universität des Saarlandes and Max-Planck-Institut für Informatik)
Kneser graphs are Hamiltonian

24.05.2023, 15:00 Uhr, Gal Kronenberg (University of Oxford)
Partitioning cubic graphs into isomorphic linear forests

17.05.2023, 15:00 Uhr, Miquel Ortega (Universitat Polit`ecnica de Catalunya)
Product-free sets in the free group

08.05.2023, 09:30 Uhr, Dr. Felix Clemen (Karlsruhe Institute of Technology)
Almost Congruent Triangles

03.05.2023, 15:00 Uhr, Robert Hancock (Universität Heidelberg)
A resolution of the Kohayakawa Kreuter conjecture for almost all pairs of graphs

03.05.2023, 09:30 Uhr, Jan-Hendrik de Wiljes (Freie Universität Berlin)
Peg Solitaire on Graphs

26.04.2023, Amedeo Sgueglia (University College London)
Multistage Maker-Breaker games

01. Februar 2023, Florian Hörsch (TU Ilmenau)
Inversions

30. Januar 2023, Hany Ibrahim (Hochschule Mittweida)
Edge contraction and forbidden subgraphs

25. Januar 2023, Andrey Kupavskii (CNRS)
Spread approximations for forbidden intersection problems

16. Januar 2023, Prof. Michael Stiebitz (Technische Universität Ilmenau)
Borsuk-type graph families

09. Januar 2023, Felix Joos (Universität Heidelberg)
Random perfect matchings in regular graphs

12. Dezember 2022, Pranshu Gupta (Universität Passau)
Ramsey simplicity of random graphs

07. Dezember 2022, Alberto Espuny Díaz (Technische Universität Ilmenau)
Long running times for hypergraph bootstrap percolation

01. Dezember 2022, Letícia Mattos (Freies Universität Berlin)
Bounds for essential covers of the cube

21. November 2022 (online via Webex), Freddie Illingworth (University of Oxford)
Defective colouring of hypergraphs

07. November 2022 (online via Webex), Matías Pavez-Signé (University of Warwick)
Counting spanning subgraphs in dense hypergraphs

26. Oktober 2022, Olaf Parczyk (Freie Universität Berlin)
A general approach to transversal versions of Dirac-type theorems

19. Oktober 2022, Elad Aigner-Horev (Ariel University)
Random perturbations of discrete structures — a brief survey
 

21. Juni 2022, Cléophée Robin (G-SCOP, Grenoble)

"When all holes have the same length"

14. Juni 2022, Shoham Letzter (University College London)

"Immersion of complete digraphs in Eulerian digraphs"

07. Juni 2022, Jochen Harant (Technische Universität Ilmenau)

"Spanning trees of smallest maximum degree in subdivisions of graphs"

27. Januar 2022, Samuel Mohr (Masaryk University)
"Uniform Turán density"

09. Dezember 2021, Candida Bowtell (University of Birmingham and University of Oxford)
"The n-queens problem"

02. Dezember 2021, Henning Bruhn-Fujimoto (Universität Ulm)
"Packing and covering of edge-disjoint graphs"

18. November 2021, Akshat Mudgal (University of Oxford)
"On energy variants of the sum-product problem"

11. November 2021, Nicolás Sanhueza-Matamala (Universidad de Concepción)
"On suffient conditions for Hamiltonicity in dense graphs"

04. November 2021, Benjamin Bumpus (Eindhoven University of Technology)
"Spined Categories: generalising tree-width beyond graphs"

28. Oktober 2021, Asaf Ferber (University of California, Irvine)
"Odd subgraphs are odd"

21. Oktober 2021, Florian Hörsch (TU Ilmenau)
"On the problem of balancing two spanning trees"

14. Oktober 2021, Stefan Glock (ETH Zürich)
"The intersection spectrum of 3-chromatic intersecting hypergraphs"

27.07.2021 Natalie Behague (Ryerson University)
"Subgraphs in Semi-random Graphs"

20.07.2021 Maria Axenovich (KIT)
"Sum-distinguishing number of hypergraphs"

13.07.2021 Antonio Girão (Heidelberg)
"Partitioning a tournament into powers of paths"

29.06.2021 Guillem Perarnau (UPC Barcelona)
"Maximum stationary values in directed random graphs"

15.06.2021 Viresh Patel (Amsterdam)
"Path decompositions of random directed graphs"

08.06.2021 Round the World Relay in Combinatorics

01.06.2021 Oriol Serra (UPC Barcelona)
"Extremal sets with minimum shadow"

25.05.2021 Ross Kang (Radboud University)
"Triangle-free graphs, independent set structure, and the hard-core model"

18.05.2021 (5 pm) Tara Abrishami (Princeton)
"Induced subgraph obstructions to bounded treewidth"

11.05.2021 Tom Kelly (Birmingham)
"A proof of the Erdös-Faber-Lovász conjecture"

26.04.2021 Patrick Morris (Freie Universität Berlin)
"Triangle factors in pseudorandom graphs"

19.04.2021 Florian Hoersch (GSCOP, Grenoble)
"Reachability in arborescence packings"

22.03.2021 Bertille Granet (University of Birmingham)
"Path Decompositions of Tournaments"

15.03.2021 Max Wötzel (UPC Barcelona)
"On the typical structure of sets with small sumset"

08.03.2021 Samuel Mohr (Masaryk University)
"Quasirandom Latin squares"

01.03.2021 Thomas Schweser (TU Ilmenau)
"Critical Digraphs"

22.02.2021 Elad Aigner-Horev (Ariel University)
"Rainbow cliques in randomly perturbed dense graphs"

15.02.2021 Olaf Parczyk (London School of Economics)
"Resilience for Hamiltonicity in random hypergraphs"

08.02.2021 Matthias Kriesell (TU Ilmenau)
"Partitions of graphs into two subgraphs of minimum degree ≥ 1 and ≥ 2 with prescribed order"

01.02.2021 Alberto Espuny Díaz (TU Ilmenau)
"Hamiltonicity of randomly perturbed graphs"

25.01.2021 Michael Stiebitz (TU Ilmenau)
"Partitions of graphs with constraints on the maximum degree"

18.01.2021 Jochen Harant (TU Ilmenau)
"A new lower bound on the independence number"

11.01.2021 Thomas Böhme (TU Ilmenau)
"Separators in geometric graphs"