Pages that link to "Item:Q4993263"
From MaRDI portal
The following pages link to Covering and tiling hypergraphs with tight cycles (Q4993263):
Displaying 10 items.
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (Q511402) (← links)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- Towards Lehel's conjecture for 4-uniform tight cycles (Q2111790) (← links)
- Hamiltonicity in cherry-quasirandom 3-graphs (Q2122670) (← links)
- Dirac-type results for tilings and coverings in ordered graphs (Q5056387) (← links)
- Komlós's tiling theorem via graphon covers (Q5379813) (← links)
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
- Cycle decompositions in \(k\)-uniform hypergraphs (Q6500099) (← links)