6 citations · 23 across the 19 of their papers we have counts for
19 papers
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…
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_{…
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…
Stability through non-shadows
Jun Gao, Hong Liu, Zixiang Xu
We study families with restricted intersections and prove a conjecture of Snevily in a stronger form for large . We also obtain stability results…
On two cycles of consecutive even lengths
Jun Gao, Binlong Li, Jie Ma +1
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart…
Tight bounds towards a conjecture of Gallai
Jun Gao, Jie Ma
We prove that for , if is an -vertex graph with chromatic number but any its proper subgraph has smaller chromatic number, then contains at most c…