Pages that link to "Item:Q516075"
From MaRDI portal
The following pages link to Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075):
Displaying 17 items.
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering (Q785570) (← links)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
- 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)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition (Q5043057) (← 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)
- Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors (Q5373833) (← links)
- Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- Clique-factors in graphs with sublinear -independence number (Q6064154) (← links)
- F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
