Pages that link to "Item:Q5900501"
From MaRDI portal
The following pages link to A lower bound for the length of a partial transversal in a Latin square (Q5900501):
Displaying 39 items.
- Rainbow sets in the intersection of two matroids (Q256994) (← links)
- Existence of rainbow matchings in strongly edge-colored graphs (Q294535) (← 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)
- Graph theory. Abstracts from the workshop held January 6--12, 2019 (Q782972) (← links)
- An approximate version of a conjecture of Aharoni and Berger (Q1649359) (← links)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- Balanced equi-\(n\)-squares (Q2205119) (← links)
- Transversals in \(m \times n\) arrays (Q2320748) (← links)
- Rainbow matchings in strongly edge-colored graphs (Q2339436) (← links)
- Orthogonal matchings revisited (Q2352074) (← links)
- Topological methods for the existence of a rainbow matching (Q2413401) (← links)
- Covers and partial transversals of Latin squares (Q2414936) (← links)
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (Q2422235) (← 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 color-balanced perfect matchings in color-balanced complete graphs (Q2666593) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- Rainbow matchings: existence and counting (Q2857432) (← links)
- A note on rainbow matchings (Q2874039) (← links)
- Rainbow Matchings in Properly Colored Multigraphs (Q3174698) (← links)
- Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
- Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015) (← links)
- Large rainbow matchings in semi-strong edge-colorings of graphs (Q4634524) (← links)
- On the number of symbols that forces a transversal (Q4993090) (← links)
- New bounds for Ryser’s conjecture and related problems (Q5071853) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting (Q5397732) (← links)
- Full rainbow matchings in graphs and hypergraphs (Q5886109) (← links)
- Transversals in quasirandom latin squares (Q6051613) (← 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)
- All group‐based latin squares possess near transversals (Q6187426) (← links)
