Ningyuan Yang

activity

20242026

collaborators

6 papers

math.CO2026

Chromatic thresholds for linear equations and recurrence

Hong Liu, Zhuo Wu, Ningyuan Yang +1

Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $F_{p}$ . Given a homogeneous equation…

math.CO2026

Upper Bounds on TurÃ¡n Densities via Extremal Set Theory

Yaobin Chen, Xizhi Liu, Ningyuan Yang +1

We exhibit, in a systematic way, connections between hypergraph TurÃ¡n problems and extremal set theory. More specifically, we construct natural families of uniform hypergraphs for…

math.CO2026

Infinitely many groups exhibiting intermediate growth in maximal sum-free sets

JÃ³zsef Balogh, Ramon I. Garcia, Hong Liu +1

Given an Abelian groups $G$ , denote $I^¼ (G)$ the size of its largest sum-free subset and $f_{m a x} (G)$ the number of maximal sum-free sets in $G$ . Confirming a prediction by Liu and…

math.CO2025

Sharing tea on a graph

J. Pascal Gollin, Kevin Hendrey, Hao Huang +6

Motivated by the analysis of consensus formation in the Deffuant model for social interaction, we consider the following procedure on a graph $G$ . Initially, there is one unit of t…

math.CO2025

On decycling and forest numbers of Cartesian products of trees

Ali Ghalavand, Sandi KlavÅ¾ar, Ning Yang

The decycling number $\nabla (G)$ of a graph $G$ is the minimum number of vertices that must be removed to eliminate all cycles in $G$ . The forest number $f (G)$ is the maximum numbe…

math.CO2024

Many cliques with small degree powers

Ting-Wei Chao, Zichao Dong, Zijun Shen +1

Suppose $0 < p \leq \infty$ . For a simple graph $G$ with a vertex-degree sequence $d_{1}, \dots, d_{n}$ satisfying $(d_{1}^{p} + \dots + d_{n}^{p})^{1/ p} \leq C$ , we prove asymptotically sharp u…