Rainbow matchings in properly edge colored graphs
type: Item
instance of: scholarly article
title: Rainbow matchings in properly edge colored graphs
zbMATH Open document ID: 1230.05137
published in: The Electronic Journal of Combinatorics
publication date: 2011-10-18T00:00:00Z
full work available at URL: v18i1p162.html
review text: Summary: Let \(G\) be a properly edge colored graph. A rainbow matching of \(G\) is a matching in which no two edges have the same color. Let \(\delta \) denote the minimum degree of \(G\). We show that if \(|V (G)| \geq \frac{8\delta}{5} \), then \(G\) has a rainbow matching of size at least \(\lfloor \frac{3\delta}{5} \rfloor \). We also prove that if \(G\) is a properly colored triangle-free graph, then \(G\) has a rainbow matching of size at least \(\lfloor \frac{2\delta }{3}\rfloor \).
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5960024
zbMATH Keywords: rainbow matchings
zbMATH Keywords: properly colored graphs
zbMATH Keywords: triangle-free graphs
author: Guanghui Wang
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5960024