activity
20162020
most citedVertex degree sums for perfect matchings in 3-uniform hypergraphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

8 papers · 1 filter

math.CO2020

Minimum degree thresholds for Hamilton -cycles in -uniform hypergraphs

Hiep Han, Jie Han, Yi Zhao

For any even integer , integer such that , and sufficiently large , we find a tight minimum -degree condition that guarantees t…

math.CO2019

Existence thresholds and Ramsey properties of random posets

Victor Falgas-Ravry, Klas Markström, Andrew Treglown +1

Let denote the power set of , ordered by inclusion, and let denote the random poset obtained from by retaining each element…

math.CO2019

Triangle-degrees in graphs and tetrahedron coverings in 3-graphs

Victor Falgas--Ravry, Klas Markström, Yi Zhao

We investigate a covering problem in -uniform hypergraphs (-graphs): given a -graph , what is , the least integer such that if is an -vertex -gr…

math.CO2019

Vertex degree sums for matchings in 3-uniform hypergraphs

Yi Zhang, Yi Zhao, Mei Lu

Let be positive integers such that is sufficiently large and . Suppose is a 3-uniform hypergraph of order . If contains no isolated vertex and $deg(…

math.CO2018

Hamiltonicity in randomly perturbed hypergraphs

Jie Han, Yi Zhao

For integers and , we prove that for any , there exist and such that for sufficiently large , the union of a $k…

math.CO20172 cited

Vertex degree sums for perfect matchings in 3-uniform hypergraphs

Yi Zhang, Yi Zhao, Mei Lu

We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that is a 3-uniform h…