Pages that link to "Item:Q5497101"
From MaRDI portal
The following pages link to A geometric theory for hypergraph matching (Q5497101):
Displayed 41 items.
- Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs (Q2032871) (← links)
- Powers of Hamiltonian cycles in multipartite graphs (Q2075502) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- Cyclic triangle factors in regular tournaments (Q2335694) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- On the co-degree threshold for the Fano plane (Q2441623) (← links)
- Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
- The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Triangle‐factors in pseudorandom graphs (Q4968390) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- Dirac-type results for tilings and coverings in ordered graphs (Q5056387) (← links)
- A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs (Q5071104) (← links)
- Almost all Steiner triple systems are almost resolvable (Q5135409) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- (Q5241134) (← links)
- Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
- On Directed Versions of the Hajnal–Szemerédi Theorem (Q5364261) (← links)
- Perfect Packings in Quasirandom Hypergraphs II (Q5366906) (← links)
- Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
- Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors (Q5373833) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099) (← links)
- Transversal <i>C<sub>k</sub></i>-factors in subgraphs of the balanced blow-up of <i>C<sub>k</sub></i> (Q5886351) (← links)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
- F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
- A Ramsey–Turán theory for tilings in graphs (Q6185051) (← links)