Lan Wang

activity

20222026

collaborators

13 papers

math.CO2026

Induced Size-Ramsey Numbers of Odd Cycles via Spread Measures

Lanchao Wang, Xiaolin Wang

We prove that, for every $k \geq 2$ and every sufficiently large odd $n$ , the induced size--Ramsey number of $C_{n}$ satisfies \[ \widehat R_{\mathrm{ind}}(C_n;k)=e^{Θ(k)}n. \] This imp…

math.CO2026

Prescribed-order subdigraphs with large minimum out-degree

Bin Chen, Lanchao Wang

Alon introduced $d (s)$ as the largest integer $d$ such that every digraph on $2 n$ vertices with minimum out-degree at least $s$ contains a subdigraph on $n$ vertices with minimum o…

math.CO2026

Superlinear Lower Bounds for Monochromatic Path Partitions

Heng Li, Lanchao Wang

In 1989, Gyárfás conjectured that the vertex set of every $r$ -edge-coloured complete graph can be partitioned into at most $r$ vertex-disjoint monochromatic paths. Erdős, Gyárfás,…

math.CO2026

The Turán number of the Cartesian product of trees via star-flip

Lanchao Wang, Caihong Yang

Motivated by Erdős's conjecture on the Turán number of degenerate bipartite graphs, Bradač, Janzer, Sudakov and Tomon proved that $ \ex(n,T \Box P)=Θ_{T,P}(n^{3/2})$ for every nont…

math.CO2026

Tight Staircase Bounds for Cyclic Subsets below Dirac's Threshold

Hong Liu, Mengyuan Niu, Lanchao Wang +1

Let $Cyc (G)$ denote the number of cyclic subsets in a graph $G$ , which are subsets that induce a Hamiltonian subgraph. Draganić, Keevash and Müyesser recently proved…

math.CO2026

An exact robust Ramsey theorem for matchings

Mengyuan Niu, Lanchao Wang

Keevash and Michaeli recently proved that, under the robustness assumption that $G$ is an $s$-connector (i.e. $\overline G$ is $K_{s,s}$-free), $G$ has essentially the sa…

math.CO2026

Constructor--Blocker games forbidding even cycles

Lanchao Wang, Zhifei Yan

The Constructor--Blocker game is played on the edge set of $K_{n}$ . Two players alternately claim previously unclaimed edges. Constructor aims to maximize the number of copies of a t…

math.CO2026

Structural Reductions for Monochromatic Matchings and Ramsey Tilings

Hong Liu, Maksim Turevskii, Lanchao Wang +1

The Alon--Frankl--Lovász theorem determines the chromatic number of Kneser hypergraphs; equivalently, it gives the sharp minimum size of a monochromatic matching in every edge-colo…

math.CO2026

Triangle packings in randomly perturbed graphs

Xinbu Cheng, Hong Liu, Lanchao Wang +1

The longstanding Nash-Williams conjecture asserts that every $K_{3}$ -divisible graph $G$ with $δ (G) \geq 3 n /4$ admits a triangle decomposition. In the random setting, Frankl and Rödl s…

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…

math.CO2022

The connectedness of the friends-and-strangers graph of lollipop graphs and others

Lanchao Wang, 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…

math.CO2022

Connectivity of friends-and-strangers graphs on random pairs

Lanchao Wang, Yaojun Chen

Consider two graphs $X$ and $Y$ , each with $n$ vertices. The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $…