Guiying Yan

activity

20242026

most citedAnti-Ramsey Numbers of Expansions of Doubly Edge-critical Graphs in Uniform Hypergraphs

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

collaborators

8 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…

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…

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.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$ vert…

math.CO2024

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)$ v…

math.CO2024★ 1 cited

Planar Turán number for balanced double stars

Xin Xu, Qiang Zhou, Tong Li +1

Planar Turán number, denoted by $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. Ghosh, Győri, Paulos…

math.CO2024★ 2 cited

Anti-Ramsey Numbers of Expansions of Doubly Edge-critical Graphs in Uniform Hypergraphs

Tong Li, Yucong Tang, Guiying Yan

For an $r$ -graph $H$ , the anti-Ramsey number $ar (n, r, H)$ is the minimum number $c$ of colors such that for any edge-coloring of the complete $r$ -graph on $n$ vertices with at…

math.CO2024

Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs

Tong Li, Yucong Tang, Guanghui Wang +1

For a fixed family of $r$ -uniform hypergraphs $F$ , the anti-Ramsey number of $F$ , denoted by $a r (n, r, F)$ , is the minimum number $c$ of colors such th…

The induced-P4​-free process