The following pages link to (Q4177580):
Displaying 22 items.
- Rainbow sets in the intersection of two matroids (Q256994) (← links)
- An improved bound on the sizes of matchings guaranteeing a rainbow matching (Q281599) (← links)
- Longest partial transversals in plexes (Q404534) (← links)
- Rainbow matchings and rainbow connectedness (Q510322) (← links)
- On rainbow matchings in bipartite graphs (Q510529) (← links)
- Rainbow perfect matchings in \(r\)-partite graph structures (Q510578) (← links)
- Rainbow matchings in bipartite multigraphs (Q524181) (← links)
- A matroid generalization of a result on row-Latin rectangles (Q1818212) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Topological methods for the existence of a rainbow matching (Q2413401) (← links)
- Rainbow matchings and cycle-free partial transversals of Latin squares (Q2449167) (← links)
- Large matchings in bipartite graphs have a rainbow matching (Q2637240) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- New bounds for Ryser’s conjecture and related problems (Q5071853) (← links)
- A lower bound for the length of a partial transversal in a Latin square (Q5900501) (← links)
- A lower bound for the length of a partial transversal in a Latin square (Q5905147) (← links)
- Orthogonal matchings (Q5906853) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Hamilton transversals in random Latin squares (Q6074871) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
