Longest partial transversals in plexes
From MaRDI portal
Publication:404534
DOI10.1007/S00026-014-0231-ZzbMATH Open1301.05043OpenAlexW1975860297MaRDI QIDQ404534FDOQ404534
Authors: Nicholas J. Cavenagh, Ian M. Wanless, Jaromy Kuhl 
Publication date: 4 September 2014
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-014-0231-z
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)
Cites Work
- An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
- Title not available (Why is that?)
- Transversals in Latin squares: a survey
- The number of transversals in a Latin square
- On a Generalization of the Ryser-Brualdi-Stein Conjecture
- Ryser's conjecture for tripartite 3-graphs
- Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
- Rainbow matchings in properly edge colored graphs
- Indivisible plexes in Latin squares
- Nearly perfect matchings in regular simple hypergraphs
- Rainbow matchings: existence and counting
- Latin Squares with Restricted Transversals
- A uniqueness result for \(3\)-homogeneous Latin trades.
- Rainbow Hamilton cycles in random regular graphs
- Latin squares with no small odd plexes
- A generalization of transversals for Latin squares
- Indivisible partitions of Latin squares
Cited In (3)
This page was built for publication: Longest partial transversals in plexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404534)
