Title   name 2018 Discrete Math 세미나     Title Largest 2-regular subgraphs in 3-regular graphs   Speaker   Choi, Ilkyoo       Date 2018-11-26   Host   Place KAIST   File     Abstract : For a graph G, let f2(G) denote the largest number of vertices in a 2-regular subgraph of G. We determine the minimum of f2(G) over 3-regular n-vertex simple graphs G. To do this, we prove that every 3-regular multigraph with exactly c cut-edges has a 2-regular subgraph that omits at most max{0,⎣(c-1)/2⎦} vertices. More generally, every n-vertex multigraph with maximum degree 3 and m edges has a 2-regular subgraph that omits at most max{0, ⎣(3n-2m+c-1)/2⎦} vertices. More generally, every n-vertex multigraph with maximum degree 3 and m edges has a 2-regular subgraph that omits at most max{0, ⎣(3n-2m+c-1)/2⎦} vertices.

Information Center for Basic Sciences KAIST 291 Daehak-ro (373-1 Guseong-dong), Yuseong-gu, Daejeon 34141, Republic of Korea TEL +82-42-869-8196, FAX +82-42-869-5722, e-mail : mathnet@mathnet.or.kr Copyright (c) 2017 by The MathNet Koea. All Rights Reserved