2 citations · 2 across the 3 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
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(…
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…
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…