Mei Lu

collaborators

7 papers

math.CO2026

Inversion diameter and treewidth

Yichen Wang, Haozhe Wang, Yuxuan Yang +1

In an oriented graph $G$ , the inversion of a subset $X$ of vertices is the operation that reverses the orientation of all arcs with both end-vertices in $X$ . The i…

math.CO2026

A generalization of ErdÅs-Hajnal problem on paths with equal-degree endpoints

Xiamiao Zhao, Yichen Wang, Mei Lu

ErdÅs and Hajnal proposed a problem that: is it true that every $(2 n + 1)$ -vertex graph with $n^{2} + n + 1$ edges contains two vertices of equal degree connected by a path of length thre…

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…

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 maximum sum of sizes of non-empty cross $L$ -intersecting families

Xiamiao Zhao, Haixiang Zhang, Mei Lu

Let $n$ , $r$ , and $k$ be positive integers such that $k, r \geq 2$ , $L$ a non-empty subset of $[k]$ , and $F_{i} \subseteq (k [ n ])$ for $1 \leq i \leq r$ . We say that…

math.CO2025

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph

Yichen Wang, Mengyu Cao, Zequn Lv +1

Let $t, q$ and $n$ be positive integers. Write $[q] = {1, 2, \dots, q}$ . The generalized Hamming graph $H (t, q, n)$ is the graph whose vertex set is the cartesian product of $n$ copie…

Inversion diameter and treewidth

A generalization of ErdÅs-Hajnal problem on paths with equal-degree endpoints

Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs

Edge version of the inducibility via the entropy method

The maximum sum of sizes of non-empty cross L-intersecting families

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph

A generalization of ErdÅs-Hajnal problem on paths with equal-degree endpoints

The maximum sum of sizes of non-empty cross $L$ -intersecting families