Yan Wang

activity

20162022

most citedRainbow perfect matchings for 4-uniform hypergraphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

10 papers · 1 filter

math.CO2022

Graph Partitions Under Average Degree Constraint

Yan Wang, Hehui Wu

In this paper, we prove that every graph with average degree at least $s + t + 2$ has a vertex partition into two parts, such that one part has average degree at least $s$ , and the oth…

math.CO2021

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $k$ and $n$ be two integers, with $k \geq 3$ , $n \equiv 0 (mod k)$ , and $n$ sufficiently large. We determine the $(k - 1)$ -degree threshold for the existence of a rainbow perfect ma…

math.CO2021

Improved bound for Hadwiger's conjecture

Yan Wang

Hadwiger conjectured in 1943 that for every integer $t \geq 1$ , every graph with no $K_{t}$ minor is $(t - 1)$ -colorable. Kostochka, and independently Thomason, proved every graph with…

math.CO2021★ 1 cited

Rainbow perfect matchings for 4-uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $n$ be a sufficiently large integer with $n \equiv 0 (mod 4)$ and let $F_{i} \subseteq (4 [ n ])$ where $i \in [n /4]$ . We show that if each vertex of $F_{i}$ is contained in more…

math.CO2020

A better bound on the size of rainbow matchings

Hongliang Lu, Yan Wang, Xingxing Yu

Aharoni and Howard conjectured that, for positive integers $n, k, t$ with $n \geq k$ and $n \geq t$ , if $F_{1}, \dots, F_{t} \subseteq (k [ n ])$ such that $|F_i|>{n\choose k}-{n-t+1\cho…

math.CO2019

$b$ -invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

Fuliang Lu, Xing Feng, Yan Wang

A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge $e$ in a brick $G…

Graph Partitions Under Average Degree Constraint

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Improved bound for Hadwiger's conjecture

Rainbow perfect matchings for 4-uniform hypergraphs

A better bound on the size of rainbow matchings

b-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

$b$ -invariant edges in essentially 4-edge-connected near-bipartite cubic bricks