Pages that link to "Item:Q1689974"
From MaRDI portal
The following pages link to Covering and tiling hypergraphs with tight cycles (Q1689974):
Displaying 9 items.
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (Q511402) (← links)
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering (Q785570) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- Tight co-degree condition for packing of loose cycles in 3-graphs (Q2833250) (← links)
- On the minimum size of tight hypergraphs (Q4014271) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- Komlós's tiling theorem via graphon covers (Q5379813) (← links)
