Yan Wang

activity

20152026

most citedA better bound on the size of rainbow matchings

9 citations · 20 across the 24 of their papers we have counts for

collaborators

Showing 2026 · math.COShow all

7 papers · 2 filters

math.CO2026

Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions

Cheng Chi, Yan Wang

For integers $n \geq s \geq 2$ , let $e (n, s)$ be the maximum size of a family $F \subseteq 2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e (n, s)$ , now…

math.CO2026

Perfect matching in 4-partite 4-uniform hypergraphs

Hongliang Lu, Yan Wang, Feihong Yuan

A balanced $k$ -partite $k$ -graph is a $k$ -uniform hypergraph such that every edge intersects each partition class in exactly one vertex, where each partition class has size $n$ . Lo…

math.CO2026

New Extremal Ranges and Constructions of the Erdős--Kleitman Problem

Cheng Chi, Yan Wang

For integers $n \geq s \geq 2$ , let $e (n, s)$ denote the maximum size of a family $F \subseteq 2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e (n, s)$ ,…

math.CO2026

Proofs of Two Conjectures of Alon on Subgraph Counts

Peiru Kuang, Shuang Sun, Yan Wang +1

All graphs considered are finite with no isolated vertices. Let $N (m, H)$ be the maximum number of subgraphs of a graph $G$ isomorphic to $H$ , taken over all graphs $G$ with $m$ edg…

math.CO2026

Induced subdivisions in graphs of large girth

Peiru Kuang, Yan Wang

In this paper, we prove that there exists an absolute constant $g_{0}$ such that, for every integer $k \geq 3$ , every graph $G$ with $δ (G) \geq k$ and $g (G) \geq g_{0}$ contains an induced s…

math.CO2026

Graphs with girth 8 and without longer even holes are 3-colorable

Yan Wang, Rong Wu

For an integer $ℓ \geq 2$ , let $H_{ℓ}$ denote the family of graphs which have girth $2 ℓ$ and have no even hole of length greater than $2 ℓ$ . Wu, Xu and Xu conject…