Skip to content

Author

Xiu-Mei Wang

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Tur\'an problems with bounded matching number in $k$-uniform hypergraphs

For a family $\mathcal{F}$ of $k$-graphs, $ex_k(n,\mathcal{F})$ denotes the maximum number of edges in an $n$-vertex $\mathcal{F}$-free $k$-graph. Let $M_{s+1}^k$ denote a matching of size $s+1$ in $k$-uniform hypergraphs. Recently, Alon and Frankl (JCTB, 2024) determined $ex_2(n,\{M_{s+1}^2,K_{\ell+1}\})$ for all $n\g...

Jia-Lin Liu, Ming-Yang Guo, Xiu-Mei Wang · 0 citations
Preprint Sep 2026

Sim-Width, Induced Matching Treewidth, and Tree-Independence Number in Induced $K_{t,t}$-Free Graphs

The tree-independence number $tree\text{-}\alpha(G)$, the induced matching treewidth $tree\text{-}\mu(G)$, and the sim-width $simw(G)$ are graph parameters defined in terms of tree or branch decompositions. We establish two polynomial bounds for the tree-independence number of induced $K_{t,t}$-free graphs, one in term...

Meng-Yuan Niu, Xiu-Mei Wang · 1 citation · ⚡1
Preprint Sep 2026

Tur\'an problems with bounded matching number in $k$-uniform hypergraphs

For a family $\mathcal{F}$ of $k$-graphs, $\ex_k(n,\mathcal{F})$ denotes the maximum number of edges in an $n$-vertex $\mathcal{F}$-free $k$-graph. Let $M_{s+1}^k$ denote a matching of size $s+1$ in $k$-uniform hypergraphs. Recently, Alon and Frankl (JCTB, 2024) determined $\ex_2(n,\{M_{s+1}^2,K_{\ell+1}\})$ for all $n...

Jia-Lin Liu, Ming-Yang Guo, Xiu-Mei Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.