6 citations · 23 across the 19 of their papers we have counts for
Showing 2023Show all
3 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
Extremal number of graphs from geometric shapes
Jun Gao, Oliver Janzer, Hong Liu +1
We study the Turán problem for highly symmetric bipartite graphs arising from geometric shapes and periodic tilings commonly found in nature. 1. The prism $C_{2\ell}^{\square}:=C_{…
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…