Pages that link to "Item:Q1363674"
From MaRDI portal
The following pages link to Almost perfect matchings in random uniform hypergraphs (Q1363674):
Displaying 12 items.
- The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs (Q519211) (← links)
- On the number of nearly perfect matchings in almost regular uniform hypergraphs (Q1817560) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- Co-degrees resilience for perfect matchings in random hypergraphs (Q2294109) (← links)
- Randomly generated intersecting hypergraphs II (Q3419609) (← links)
- Perfect matchings in random uniform hypergraphs (Q4434467) (← links)
- Packing perfect matchings in random hypergraphs (Q4642740) (← links)
- (Q4716332) (← links)
- Perfect matchings in random s‐uniform hypergraphs (Q4847395) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- A stochastic matching model on hypergraphs (Q5013243) (← links)