National Institute of Informatics, Tokyo, Japan.

*24 Tuesday*4PM-5PM

Hajos’ conjecture is false, and it seems that graphs without a subdivision of a big complete graph do not behave as well as those without a minor of a big complete graph.

In fact, the graph minor theorem (a proof of Wagner’s conjecture) is not true if we replace the minor relation by the subdivision relation. I.e, For every infinite sequence G_{1},G_{2}, … of graphs, there exist distinct integers i<j such that G_{i} is a minor of G_{j}, but if we replace ”minor” by ”subdivision”, this is no longer true.

This is partially because we do not really know what the graphs without a subdivision of a big complete graph look like.

In this talk, we shall discuss this issue. In particular, assuming some moderate connectivity condition, we can say something, which we will present in this talk.

Topics also include coloring graphs without a subdivision of a large complete graph, and some algorithmic aspects. Some of the results are joint work with Theo Muller.