Rainbow matchings and cycle-free partial transversals of Latin squares-Reference-Cited by-同舟云学术

Rainbow matchings and cycle-free partial transversals of Latin squares

Published:2014-07 Issue: Volume:327 Page:96-102
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Gyárfás András,Sárközy Gábor N.

Funder

Hungarian Scientific Research Fund

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference9 articles.

1. A lower bound for the length of partial transversals in a Latin square;Brouwer;Nieuw Arch. Wiskd. (5),1978

2. Rainbow matchings of size δ(G) in properly edge-colored graphs;Diemunsch;Electron. J. Combin.,2012

3. A lower bound for the length of a partial transversal in a Latin square;Hatami;J. Combin. Theory Ser. A,2008

4. A note on large rainbow matchings in edge-coloured graphs;Lo;Graphs Combin.,2014

5. H.J. Ryser, Neuere probleme der kombinatorik, in: Vorträge über Kombinatorik Oberwolfach, Mathematisches Forschungsinstitut Oberwolfach, July 1967.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Large Rainbow Matchings in Edge-Colored Graphs with Given Average Color Degree;Graphs and Combinatorics;2022-08-11

2. Hamilton transversals in random Latin squares;Random Structures & Algorithms;2022-06-14

3. Minimum degree conditions for monochromatic cycle partitioning;Journal of Combinatorial Theory, Series B;2021-01

4. Long directed rainbow cycles and rainbow spanning trees;European Journal of Combinatorics;2020-08

5. Rainbow Matchings of size $m$ in Graphs with Total Color Degree at least $2mn$;The Electronic Journal of Combinatorics;2020-07-24