On sets not belonging to algebras and rainbow matchings in graphs

DOI10.1016/j.jctb.2016.05.006zbMath1350.05031arXiv1508.06437OpenAlexW2963808008MaRDI QIDQ345074

Alexey Pokrovskiy, Julia Ehrenmüller, Dennis Clemens

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.06437

zbMATH Keywords

equivalence classesmultigraphsrainbow matchingsedge colourings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Representation of Large Matchings in Bipartite Graphs, Degree Conditions for Matchability in 3‐Partite Hypergraphs, Rainbow matchings and algebras of sets

Cites Work

• Unnamed Item
• Unnamed Item
• An improved bound on the sizes of matchings guaranteeing a rainbow matching
• Rainbow matchings and connectedness of coloured graphs
• Transversals of latin squares and their generalizations
• Families of sets not belonging to algebras and combinatorics of finite sets of ultrafilters
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Combinatorics: Ancient and Modern
• Orthogonal Latin Rectangles
• Theorems on sets not belonging to algebras
• Rainbow matchings and algebras of sets