2 papers
math.CO2026
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…
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…