Midsummer Combinatorial Workshop XXX

July 28 - August 1, 2025, Prague

Announcement

The workshop continues the tradition of Prague Combinatorial Workshops held since 1993. Oriented on problems of all fields of graph theory, combinatorics and discrete geometry, it will continue in the spirit and informal working atmosphere of the previous meetings.

The workshop takes place at DIMATIA and the Department of Applied Mathematics of Charles University, Malostranske namesti 25, Prague 1, which is located in a historic building in the center of Old Prague. The workshop is also supported by Computer Science Institute of Charles University.

The workshop participation is by invitation only. Regardless, if you wish to participate, please email the organizers and we will respond to you shortly. In case you need an invitation letter (for example for your visa), please let us know and we will be happy to write one for you.

Coffee breaks and part of the meals are provided by the organizers. However, we will collect a modest fee of EUR 90 towards a fraction of the expenses.

As is the tradition, the program of the workshop is determined from day to day. The afternoons are reserved for discussions and other activities. If you intend to give a talk during the MCW, please let us know a few days in advance.

If you arrive later during the workshop, please register with the secretaries in the room 222 (at the 2nd floor).

On Wednesday afternoon, there will be an awesome social event.

This workshop is part of a project that has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 810115)

Programme (tentative)

All lectures take place in room S5 at the building of Charles University, Malostranske namesti 25. The times are only indicative and are subject to change.
Monday
8:30-9:20 Registration
9:20 Welcome and organizational remarks
9:30-10:00Roman NedelaBerge conjecture for restricted families of snarks
10:00-10:30 Coffee break
10:30-11:10Peter CameronA new look at twin reduction
11:15-11:55Jan GrebíkUnique Infinite Cluster Property for Graphs and Symmetric Spaces
12:00-12:35Miklós RuszinkóRamsey numbers of paths and components
12:40-13:10Santiago Guzmán ProHereditary first-order logic and extensional ESO
Tuesday
9:00-9:30Pavel ValtrGuarding a 1.5 terrain
9:35-10:00Michal DvořákDensity of Traceable Graphs
10:00-10:30 Coffee break
10:30-11:15Rosemary BaileySemi-Latin squares and their extensions
11:25-11:45Hector BuffièreWell Quasi Orders, stability and dependence
11:50-12:10Sofia BrennerEPPA witnesses with two blocks of imprimitivity on edges
12:15-12:45Aleksandra KwiatkowskaUniversal ultrametric spaces
Wednesday
9:00-9:30Bertalan BodorConstraint satisfaction problems for tame structures
9:35-10:00Shujie YangSimplicity of Automorphism group of generic n-hypertournament
10:00-10:30 Coffee break
10:30-10:50Jan KratochvílRepExt and SimRep on geometric contact graphs
10:55-11:25Giacomo GiomiMeasure vs. Topological recurrence: Intersectivity & Non-standard methods
11:35-11:55Jialu ZhuThe Interpolation Theorem for Asymmetric Graphs
12:00-12:20Huan ZhouFractional balanced coloring of signed planar graphs
12:25-12:45Yuquan LinPath degeneracy and applications
12:45-14:45 Lunch break
14:45-15:10David ChodounskýColors of the pseudotree
15:15-15:40Nadav MeirProductive Ramsey
15:50-16:15Dragan MašulovićBig Ramsey Combinatorics of the Cantor Set
16:20-16:45Wieslaw KubisOn Universal Homomorphisms
16:45-18:00 Moving down one floor
18:00-19:00Eve QuartetConcert (downstairs)
19:30-∞Dinner (Altány Kampa)
Thursday
9:25-10:00Alexander CliftonMy favorite hyperplanes
10:00-10:30 Coffee break
10:30-10:55Lluís VenaDependencies of the coefficients of the chromatic polynomial on the induced subgraphs
11:00-11:30Guillermo Gamboa QuinteroMinimum blocking sets for families of partitions
11:40-12:00Anna Margarethe LimbachWhen do graph covers preserve clique dynamics?
12:05-12:30John SylvesterExploration of Random Spanning Temporal Graphs
12:35-12:55Maja PechThe age does not matter
Friday
9:00-9:25Gaurav KucheriyaSubcubic graphs & KT orientations
9:30-13:00Remembering Robert Woodrow
Geňa HahnRemembering Robert (eulogy)
Coffee break
Lionel Nguyen Van ThéRevisiting canonical structural Ramsey theorems
Jan HubičkaRamsey theorems for trees and big Ramsey degrees
Xuding ZhuHedetniemi's conjecture
Sam BraunfeldSome of Robert's results and problems
Patrice Ossona de MendezOn Tree Models

Travel info (public transport)

For the public transportation you can buy a 90-minute ticket for 40 CZK or 30-minute for 30 CZK in a newsstand or in a vending machine. Some vending machines only accept coins (no credit cards, no paper money).

The ticket needs to be validated (in a magic yellow validating machine with a shining arrow). The validating machines are located inside buses and trams. In the Metro subway system, the machine is located at the entryway to the station.

If you need to find a tram connection, you can use the official website. The department building is located near the tram stop "Malostranske namesti". You can see it from the tram stop. It is this building.

Contact

All e-mail correspondence concerning the workshop (e.g. registration, accommodation) should be directed to mcw@kam.mff.cuni.cz.

organizers: Jaroslav Nesetril, Jan Hubicka, Matej Konecny

Previous Workshops