15 papers
Ramsey multiplicity for ordered graphs
Mengya He, Yaping Mao, Bing Wei +1
Let \(\cG_1,\ldots,\cG_k\) be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number \(\oR(\cG_1,\ldots,\cG_k)\) is the least integer \(N\) such…
The inversion number of a path-reversed tournament: Resolving a conjecture of Belkhechine, Bouaziz, Boudabbous, and Pouzet
Yaping Mao
The paper proves that the inversion number of the path‑reversed tournament Q_n equals ⌊(n‑1)/2⌋, confirming a conjecture by Belkhechine et al.
Multiplicity for partially ordered sets
Gyula O. H. Katona, Yaping Mao
Let be a nested family of finite posets such that and . For a poset , let denote the set of…
Ramsey-Turán theory for partially-ordered sets
Gyula O. H. Katona, Yaping Mao
We introduce weak and strong poset Ramsey-Turán numbers for -chains in host poset families, focusing on the Boolean lattice family . For any poset $…
From Halin's Edge Removability to Matching Removability in -Connected Graphs
Hengzhe Li, Mingming Zhou, Shinya Fujita +1
We study matching-removability under the degree/connectivity regime of Halin's theorem, which asserts that every -connected graph with minimum degree contains…
Diagonal Ramsey numbers for wheels
Maoxuan Li, Masaki Kashima, Yaping Mao
The Ramsey number is the smallest integer such that any red-blue coloring of the edges of the complete graph contains either a red copy of or…