scientific article; zbMATH DE number 3613053
From MaRDI portal
Publication:4177580
Cited in
(23)- A matroid generalization of a result on row-Latin rectangles
- Combinatorial analysis. (Matrix problems, choice theory)
- Embedding rainbow trees with applications to graph labelling and decomposition
- Topological methods for the existence of a rainbow matching
- Rainbow matchings and cycle-free partial transversals of Latin squares
- Rainbow sets in the intersection of two matroids
- Large matchings in bipartite graphs have a rainbow matching
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- An improved bound on the sizes of matchings guaranteeing a rainbow matching
- Longest partial transversals in plexes
- New bounds for Ryser’s conjecture and related problems
- Rainbow matchings and rainbow connectedness
- On rainbow matchings in bipartite graphs
- Rainbow perfect matchings in \(r\)-partite graph structures
- Rainbow matchings in bipartite multigraphs
- A lower bound for the length of a partial transversal in a Latin square
- A lower bound for the length of a partial transversal in a Latin square
- Orthogonal matchings
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Hamilton transversals in random Latin squares
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
- How to burn a Latin square
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177580)
