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 2019Show all

7 papers · 1 filter

math.CO2019

The size of graphs with restricted rainbow -connection number

Shinya Fujita, Henry Liu, Boram Park

Let be a positive integer, and be a -connected graph. An edge-coloured path is \emph{rainbow} if all of its edges have distinct colours. The \emph{rainbow -connection…

math.CO2019

Stable structure on safe set problems in vertex-weighted graphs

Shinya Fujita, Tadashi Sakuma, Boram Park

Let be a graph, and let be a positive real-valued weight function on . For every subset of , let A non-empty subset $S \subset V…

math.CO2019

On induced saturation for paths

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

For a graph , a graph is -induced-saturated if does not contain an induced copy of , but either removing an edge from or adding a non-edge to creates an in…

math.CO2019

Collapsibility of non-cover complexes of graphs

Ilkyoo Choi, Jinha Kim, Boram Park

Given a graph , the non-cover complex of is the combinatorial Alexander dual of the independence complex of . Aharoni asked if the non-cover complex of a graph withou…

math.CO2019

Largest 2-regular subgraphs in 3-regular graphs

Ilkyoo Choi, Ringi Kim, Alexandr Kostochka +2

For a graph , let denote the largest number of vertices in a -regular subgraph of . We determine the minimum of over -regular -vertex simple graphs…

math.CO2019

Maximum -sum -free sets of the 2-dimensional integer lattice

Ilkyoo Choi, Ringi Kim, Boram Park

For a positive integer , let denote . For a 2-dimensional integer lattice point and positive integers and , a \textit{-sum $…