Guiying Yan

collaborators

5 papers

math.CO2026

The induced- $P_{4}$ -free process

Hongyi Lou, Xinzhe Song, Guiying Yan

We study the random induced- $P_{4}$ -free graph process. Let $e_{1}, \dots, e_{N}$ , where $N = (2 n)$ , be a uniformly random ordering of the edges of $K_{n}$ . Starting from the empty gr…

cs.IT2026

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes

Ziyang Zhao, Haoran Xiong, Zicheng Ye +2

LDPC codes have attracted significant attention due to their capacity-approaching performance. Elementary trapping sets are the main cause of the error floor phenomenon in LDPC cod…

math.CO2026

An ErdÅs-Ko-Rado result for some principal series representations

Jiaqi Liao, Guiying Yan

Let $V$ be an irreducible principal series representation of $GL_{2} (q)$ satisfying certain conditions. Two subsets $S_{1}, S_{2} \subseteq GL_{2} (q)$ are called cross-$t…

math.CO2025

Planar TurÃ¡n number of disjoint union of $C_{3}$ and $C_{5}$

Luyi Li, Ping Li, Guiying Yan +1

The planar TurÃ¡n number of $H$ , denoted by $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex $H$ -free planar graph. The planar TurÃ¡n number of $k \geq 3$ ve…

math.CO2025

Planar TurÃ¡n number of two adjacent cycles

Xinzhe Song, Guiying Yan, Qiang Zhou

The planar TurÃ¡n number of $H$ , denoted by $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex $H$ -free planar graph. The planar TurÃ¡n number of $k (k \geq 3)$ …

The induced-P4​-free process

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes

An ErdÅs-Ko-Rado result for some principal series representations

Planar TurÃ¡n number of disjoint union of C3​ and C5​

Planar TurÃ¡n number of two adjacent cycles

The induced- $P_{4}$ -free process

An ErdÅs-Ko-Rado result for some principal series representations

Planar TurÃ¡n number of disjoint union of $C_{3}$ and $C_{5}$