[2018 Discrete Math 세미나]

** Date: ** 2018-11-26

**Speaker :** Choi, Ilkyoo (Hankuk University of Foreign Studies)

**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.

**VOD : **[VIDEO] [YOUTUBE]

Information Center for Mathematical Sciences KAIST

34141 대전광역시 유성구 대학로 291 (구성동373-1)

한국과학기술원(KAIST) 수리과학정보센터

전화 042-350-8196

e-mail : mathnet@mathnet.or.kr

Copyright (C) 2018. ICMS All Rights Reserved.

34141 대전광역시 유성구 대학로 291 (구성동373-1)

한국과학기술원(KAIST) 수리과학정보센터

전화 042-350-8196

e-mail : mathnet@mathnet.or.kr

Copyright (C) 2018. ICMS All Rights Reserved.