Qiang Sun

activity

20152026

most citedLocating any two vertices on Hamiltonian cycles

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.FA2026

Sharp Riesz capacity inequalities and the Pólya--Szegő conjecture

Mengwei Su, Qiang Sun, Ge Xiong

For $n \geq 2$ and $p \in (n - 2, n)$ , we prove that closed balls maximize the ratio of Riesz $p$ -capacity to Newtonian capacity among all compact subsets of $R^{n}$ . This resolves…

math.CO2017★ 2 cited

Locating any two vertices on Hamiltonian cycles

Weihua He, Hao Li, Qiang Sun

In this paper we give a proof of Enomoto's conjecture for graphs of sufficiently large order. Enomoto's conjecture states that, if $G$ is a graph of order $n$ with minimum degree $…

math.CO2015

Walk-powers and homomorphism bound of planar graphs

Reza Naserasr, Sagnik Sen, Qiang Sun

As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2 k + 1$ admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, .…