Guiying Yan

activity

20242026

collaborators

Showing math.COShow all

7 papers · 1 filter

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…

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

math.CO2024

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, Paul…

math.CO2024

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…

The induced-P4​-free process

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