Longest partial transversals in plexes

DOI10.1007/s00026-014-0231-zzbMath1301.05043OpenAlexW1975860297MaRDI QIDQ404534

Ian M. Wanless, Nicholas J. Cavenagh, Jaromy Scott 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

zbMATH Keywords

transversalpartial Latin squareprotoplex

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items (1)

Ramsey-nice families of graphs

Cites Work

• Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
• Rainbow matchings in properly edge colored graphs
• Indivisible partitions of Latin squares
• The number of transversals in a Latin square
• Ryser's conjecture for tripartite 3-graphs
• Indivisible plexes in Latin squares
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• Nearly perfect matchings in regular simple hypergraphs
• Rainbow Matchings: existence and counting
• On a Generalization of the Ryser-Brualdi-Stein Conjecture
• Latin Squares with Restricted Transversals
• Rainbow Hamilton cycles in random regular graphs
• Latin squares with no small odd plexes
• A generalization of transversals for Latin squares
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Longest partial transversals in plexes