56 citations · 56 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
The Erdős distinct subset sums problem in a modular setting
Stijn Cambie, Jun Gao, Younjin Kim +1
We prove the following variant of the Erdős distinct subset sums problem. Given and sufficiently large , every -element set whose subset sums are distinct modul…
math.CO2023
Many Hamiltonian subsets in large graphs with given density
Stijn Cambie, Jun Gao, Hong Liu
A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with min…