Yuejian Peng

activity

20232026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Complete Characterization on Maximum Pairwise Cross Intersecting Families (I)

Yang Huang, Yuejian Peng

The families $A$ and $B$ are cross intersecting if $A \cap B \neq = \emptyset$ for any $A \in A$ and $B \in B$ . Let $t \geq 2$ and $k_1\geq k_2\geq…

math.CO2024

Intersecting families with full difference sets

Yan zilong, Peng Yuejian

For a family $F$ of subsets of a finite set, define $D (F) = {F ∖ F^{'} : F, F^{'} \in F}$ . A family $F$ is called intersecting if $F…

math.CO2024

Chromatic profiles of odd cycles

Zilong Yan, Yuejian Peng, Xiaoli Yuan

Erdős and Simonovits asked the following question: For an integer $c \geq 2$ and a family of non-bipartite graphs $F$ , what is the infimum of $α$ such that any $\mathcal{F…

math.CO2024

A strong structural stability of $C_{2 k + 1}$ -free graphs

Zilong Yan, Yuejian Peng

Füredi and Gunderson showed that $e x (n, C_{2 k + 1})$ is achieved only on $K_{⌊ \frac{n}{2} ⌋, ⌈ \frac{n}{2} ⌉}$ if $n \geq 4 k - 2$ . It is natural to study how far a $ C…

math.CO2023

Mixed pairwise cross intersecting families (I)

Yang Huang, Yuejian Peng

An $(n, k_{1}, \dots, k_{t})$ -cross intersecting system is a set of non-empty pairwise cross-intersecting families $\mathcal{F}_1\subset{[n]\choose k_1}, \mathcal{F}_2\subset{[n]\choos…

Complete Characterization on Maximum Pairwise Cross Intersecting Families (I)

Intersecting families with full difference sets

Chromatic profiles of odd cycles

A strong structural stability of C2k+1​-free graphs

Mixed pairwise cross intersecting families (I)

A strong structural stability of $C_{2 k + 1}$ -free graphs