Yichen Wang

collaborators

5 papers

math.CO2026

The maximum number of triangles in graphs without the square of a path

Yichen Wang, Ervin Győri

The generalized Turán number for $H$ of $G$ , denoted by $\ex(n,H,G)$, is the maximum number of copies of $H$ in an $n$ -vertex $G$ -free graph. When $H$ is an edge, $\ex(n,H,G)$ is t…

math.CO2025

Edge version of the inducibility via the entropy method

Yichen Wang, Xiamiao Zhao, Mei Lu

The inducibility of a graph $H$ is about the maximum number of induced copies of $H$ in a graph on $n$ vertices. We consider its edge version, that is, the maximum number of induce…

math.CO2025

The Turán number of Berge matchings

Yichen Wang, Zixuan Yang, Xiamiao Zhao +2

Given a graph $F$ , an $r$ -uniform hypergraph $H$ is a {\em Berge- $F$ } if there is a bijection $ϕ : E (F) \to E (H)$ such that $e \subseteq ϕ (e)$ for each $e \in E (F)$ .…

math.CO2025

Counting induced subgraphs with given intersection sizes

Haixiang Zhang, Yichen Wang, Xiamiao Zhao +1

Let $F$ be a graph of order $r$ . In this paper, we study the maximum number of induced copies of $F$ with restricted intersections, which highlights the motivation from extremal se…

math.CO2025

Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs

Yichen Wang, Mei Lu

Let $G$ be a graph on $n$ vertices and $t$ an integer. The reconfiguration graph of $G$ , denoted by $R_{t} (G)$ , consists of all $t$ -colorings of $G$ and two $t$ -colorings are adjacen…