Pages that link to "Item:Q2284737"
From MaRDI portal
The following pages link to The complexity of perfect matchings and packings in dense hypergraphs (Q2284737):
Displaying 10 items.
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu (Q6050000) (← links)
- F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
- Cycle-factors in oriented graphs (Q6565819) (← links)
