Description
Véges Geometria Szeminárium
Absztrakt:
Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red subgraph has minimum degree at least $1$ and contains no $3$-edge path. Recently, Bellitto et al. constructed an infinite family refuting the above conjecture.
Their example is planar, but contains a $K_4$-minor and also a $5$-cycle. This leaves the above conjecture open for some important families:
outerplanar graphs, $K_4$-minor-free graphs, bipartite graphs. In this talk, we will investigate some of these classes.
(The talk will be held in Hungarian.)
https://zoom.us/j/91259930748?pwd=cjRUakdwN1cvMzZ6aWNoaG53TkdyUT09
(Kivételesen korábban.)