Seminár z teórie grafov - Martin Škoviera (25.2.2016)

vo štvrtok 25.2.2016 o 9:50 v miestnosti M/213

---

Prednášajúci: Martin Škoviera

Názov: A reduction theorem for 6-connected eulerian graphs

Termín: 25.2.2016, 9:50, M/213

Abstrakt:
We prove that every 6-edge-connected eulerian graph of order n >= 2 containing a vertex of degree 6 can be transformed into a 6-edge-connected eulerian graph of order n-1 by removing the vertex and reinstating regularity. A similar result also holds when 6 is replaced with 4 or 2. We conjecture that 6 can be replaced by any even positive number.

This is a joit work with Edita Macajova.

---