From the 1 of 7 linked papers with an AI index.
7 papers
Superlinear Lower Bounds for Monochromatic Path Partitions
Heng Li, Lanchao Wang
In 1989, Gyárfás conjectured that the vertex set of every -edge-coloured complete graph can be partitioned into at most vertex-disjoint monochromatic paths. Erdős, Gyárfás,…
Prescribed-order subdigraphs with large minimum out-degree
Bin Chen, Lanchao Wang
Alon introduced as the largest integer such that every digraph on vertices with minimum out-degree at least contains a subdigraph on vertices with minimum o…
The Turán number of the Cartesian product of trees via star-flip
Lanchao Wang, Caihong Yang
The paper proves a conjecture that the Turán number of the Cartesian product of any two nontrivial trees grows on the order of n^{3/2}, introduces r‑star‑flip graphs, and shows the…
Tight Staircase Bounds for Cyclic Subsets below Dirac's Threshold
Hong Liu, Mengyuan Niu, Lanchao Wang +1
Let denote the number of cyclic subsets in a graph , which are subsets that induce a Hamiltonian subgraph. DraganiÄ, Keevash and Müyesser recently prov…
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…
Constructor--Blocker games forbidding even cycles
Lanchao Wang, Zhifei Yan
The Constructor--Blocker game is played on the edge set of . Two players alternately claim previously unclaimed edges. Constructor aims to maximize the number of copies of a t…