Pages that link to "Item:Q1366948"
From MaRDI portal
The following pages link to Nearly perfect matchings in regular simple hypergraphs (Q1366948):
Displayed 16 items.
- Longest partial transversals in plexes (Q404534) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- On 6-sparse Steiner triple systems (Q868878) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Random triangle removal (Q2346047) (← links)
- Note on asymptotically good packings (Q3578141) (← links)
- Cliques in Steiner systems (Q3601028) (← links)
- (Q4500484) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- Asymptotic Bounds for General Covering Designs (Q5175786) (← links)
- Steiner Triple Systems without Parallel Classes (Q5251663) (← links)
- On the Method of Typical Bounded Differences (Q5366890) (← links)
- Counting Independent Sets in Hypergraphs (Q5495674) (← links)
- Triangulations and the Hajós conjecture (Q5901432) (← links)