Boram Park

activity

20092023

most citedThe competition numbers of ternary Hamming graphs

14 citations · 118 across the 38 of their papers we have counts for

collaborators

Showing 2018Show all

6 papers · 1 filter

math.CO2018★ 3 cited

Characterization of forbidden subgraphs for bounded star chromatic number

Ilkyoo Choi, Ringi Kim, Boram Park

The chromatic number of a graph is the minimum $k$ such that the graph has a proper $k$ -coloring. There are many coloring parameters in the literature that are proper colorings tha…

math.CO2018

On toric ideals arising from signed graphs

JiSun Huh, Sangwook Kim, Boram Park

A signed graph is a pair $(G, τ)$ of a graph $G$ and its sign $τ$ , where a \textit{sign} $τ$ is a function from ${(e, v) ∣ e \in E (G), v \in V (G), v \in e}$ to ${1, - 1}$ . Note that…

math.CO2018

A Ramsey-type theorem for the matching number regarding connected graphs

Ilkyoo Choi, Michitaka Furuya, Ringi Kim +1

A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $ρ$ , every graph $G$ with sufficiently large $ρ (G)$ c…

math.CO2018

On incidence choosability of cubic graphs

Sungsik Kang, Boram Park

An incidence of a graph $G$ is a pair $(u, e)$ where $u$ is a vertex of $G$ and $e$ is an edge of $G$ incident with $u$ . Two incidences $(u, e)$ and $(v, f)$ of $G$ are adjacent whene…

math.CO2018

On the weighted safe set problem on paths and cycles

Shinya Fujita, Tommy Jensen, Boram Park +1

Let $G$ be a graph, and let $w : V (G) \to R$ be a weight function on the vertices of $G$ . For every subset $X$ of $V (G)$ , let $w (X) = \sum_{v \in X} w (v) .$ A non-empty subset…

math.CO2018★ 4 cited

Graph invariants and Betti numbers of real toric manifolds

Boram Park, Hanchul Park, Seonjeong Park

For a graph $G$ , a graph cubeahedron $□_{G}$ and a graph associahedron $△_{G}$ are simple convex polytopes which admit (real) toric manifolds. In this paper, we introduce…