Pages that link to "Item:Q5905147"
From MaRDI portal
The following pages link to A lower bound for the length of a partial transversal in a Latin square (Q5905147):
Displaying 22 items.
- Rainbow sets in the intersection of two matroids (Q256994) (← links)
- Color degree and heterochromatic cycles in edge-colored graphs (Q449221) (← links)
- Rainbow matchings in bipartite multigraphs (Q524181) (← links)
- The number of distinct symbols in sections of rectangular arrays (Q819815) (← links)
- The number of transversals in a Latin square (Q851756) (← links)
- Transversals in long rectangular arrays (Q856842) (← links)
- Transversals in row-latin rectangles (Q1273670) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- A matroid generalization of a result on row-Latin rectangles (Q1818212) (← links)
- Balanced equi-\(n\)-squares (Q2205119) (← links)
- Transversals in \(m \times n\) arrays (Q2320748) (← links)
- Rainbow matchings and cycle-free partial transversals of Latin squares (Q2449167) (← links)
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
- A NOTE ON RAINBOW MATCHINGS (Q2874039) (← links)
- Orthogonal Latin Rectangles (Q3527541) (← links)
- New bounds for Ryser’s conjecture and related problems (Q5071853) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- A lower bound for the length of a partial transversal in a Latin square (Q5900501) (← 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)