Event
01_1
| 제출번호(No.) | 0009 |
|---|---|
| 분류(Section) | Contributed Talk |
| 분과(Session) | Topology (TO) |
| 영문제목 (Title(Eng.)) |
Upper bound of lattice stick number of spatial graphs |
| 저자(Author(s)) |
Chaeryn Lee1, Seungsang Oh1, Hyungkee Yoo1 Korea University1 |
| 초록본문(Abstract) | The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number $s_{L}(G)$ of spatial graphs $G$ with vertices of degree at most six (necessary for embedding into the cubic lattice), and present an upper bound in terms of the crossing number $c(G)$ $$ s_{L}(G) \leq 3c(G)+6e-4v-2s+3b+k, $$ where $G$ has $e$ edges, $v$ vertices, $s$ cut-components, $b$ bouquet cut-components, and $k$ knot components. |
| 분류기호 (MSC number(s)) |
57M15, 57M25, 57M27 |
| 키워드(Keyword(s)) | lattice stick number, spatial graph |
| 강연 형태 (Language of Session (Talk)) |
Korean |