The following pages link to On a hypergraph matching problem (Q2494110):
Displaying 40 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- The clique complex and hypergraph matching (Q873650) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466) (← links)
- Emergence and dynamics of short food supply chains (Q2031240) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Matching orderable and separable hypergraphs (Q2136876) (← links)
- Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- The hypergraph assignment problem (Q2339846) (← links)
- The generalised Oberwolfach problem (Q2664557) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q2857424) (← links)
- Induced Decompositions of Highly Dense Graphs (Q2940990) (← links)
- Matching critical intersection hypergraphs (Q2968611) (← links)
- Santa claus meets hypergraph matchings (Q3189065) (← links)
- Fractional decompositions of dense hypergraphs (Q3429620) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
- Partial Steiner systems and matchings in hypergraphs (Q4705347) (← links)
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem (Q4870539) (← links)
- Large triangle packings and Tuza’s conjecture in sparse random graphs (Q4987259) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- A stochastic matching model on hypergraphs (Q5013243) (← links)
- Minimalist designs (Q5120741) (← links)
- Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process (Q5157383) (← links)
- A natural barrier in random greedy hypergraph matching (Q5222558) (← links)
- (Q5417726) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Hamilton transversals in random Latin squares (Q6074871) (← links)
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture (Q6077050) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- Cycle decompositions in \(k\)-uniform hypergraphs (Q6500099) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
- Resolution of the Oberwolfach problem (Q6621209) (← links)
