Pages that link to "Item:Q1242922"
From MaRDI portal
The following pages link to An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols (Q1242922):
Displayed 34 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)
- The number of distinct symbols in sections of rectangular arrays (Q819815) (← links)
- On the plane term rank of three dimensional matrices (Q1169537) (← links)
- An approximate version of a conjecture of Aharoni and Berger (Q1649359) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- Fair representation in dimatroids (Q1689871) (← links)
- A matroid generalization of a result on row-Latin rectangles (Q1818212) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Rainbow paths and large rainbow matchings (Q2073301) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Transversals in \(m \times n\) arrays (Q2320748) (← links)
- Topological methods for the existence of a rainbow matching (Q2413401) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← 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)
- On a Generalization of the Ryser-Brualdi-Stein Conjecture (Q2940993) (← links)
- Orthogonal Latin Rectangles (Q3527541) (← links)
- Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015) (← 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)
- Computing Autotopism Groups of Partial Latin Rectangles (Q6043670) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Hamilton transversals in random Latin squares (Q6074871) (← links)
- Choice functions (Q6105041) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)