Pages that link to "Item:Q1900519"
From MaRDI portal
The following pages link to A condition for matchability in hypergraphs (Q1900519):
Displaying 8 items.
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- Choice functions (Q6105041) (← links)
- A precise condition for independent transversals in bipartite covers (Q6542538) (← links)
- Constructing graphs with no independent transversals (Q6574378) (← links)
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs (Q6596385) (← links)
- Looms (Q6611732) (← links)
- Degree conditions for Ramsey goodness of paths (Q6655704) (← links)