Yaojun Chen

activity

20222026

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

Extremal problems for a matching and any other graph

Xiutao Zhu, Yaojun Chen

For a family of graphs $\F$, a graph is called $\F$-free if it does not contain any member of $\F$ as a subgraph. The generalized Turán number $\ex(n,K_r,\F)$ is the maximum number…

math.CO2023

The Turán number of path-star forests

Xiaona Fang, Yaojun Chen, Lihua You

The Turán number of a graph $H$ , denoted by $e x (n, H)$ , is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. A linear (star) forest is a fore…

math.CO2023

The hat guessing number of random graphs with constant edge-chosen probability

Lanchao Wang, Yaojun Chen

Let $G$ be a graph with $n$ vertices. The {\em hat guessing number} of $G$ is defined in terms of the following game: There are $n$ players and one opponent. The opponent will wear…

math.CO2023

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others

Lanchao Wang, Junying Lu, Yaojun Chen

Let $X$ and $Y$ be any two graphs of order $n$ . The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $σ:V(X) \m…