Spring 2020 Schedule

Feb 6: Miklos Bona (U. Florida), ``A method to prove that the solution to some enumeration problems is a non-rational generating function'', abstract

Feb 13: Ander Lamaison (Berlin), ``Ramsey upper density of infinite graphs'', abstract

Feb 20: Pawel Rzazewski (Warsaw University) ``Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs'', abstract

Feb 27: Nathan Keller (Bar Ilan University), ``The junta method for hypergraphs'', abstract

Mar 5: Frantisek Kardos (U. Bordeaux), ``Islands in planar graphs'', abstract

Mar 12: no talk

Mar 19: spring break

Mar 26: Nicolas Trotignon (online), ``Rankwidth, graphs on four vertices, and even holes'', abstract . The link is https://princeton.zoom.us/j/810888723 .

Apr 2: No talk

Apr 9: No talk

Apr 16: Dor Minzer, ``Oligarchy testing'', abstract, Zoom link , password needed.

Apr 23: Stephan Thomasse, ``Twin-width'', abstract, Zoom link , password will be the sent to the seminar and CLO mail-lists.

Apr 30: James Davies (U. Waterloo), ``Vertex-minor-closed classes are chi-bounded'', abstract, Zoom link , password needed and will be mailed to the seminar maillist.

For information about the seminar please send email to pds@math.princeton.edu