Pages that link to "Item:Q2826217"
From MaRDI portal
The following pages link to Codegree thresholds for covering 3-uniform hypergraphs (Q2826217):
Displaying 9 items.
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering (Q785570) (← links)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
- Minimum codegree threshold for \((K^3_4-e)\)-factors (Q1940381) (← links)
- A note on codegree problems for hypergraphs (Q2732632) (← links)
- Codegree thresholds for covering 3-uniform hypergraphs (Q2826217) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- Dirac-type results for tilings and coverings in ordered graphs (Q5056387) (← links)