Rainbow perfect matchings in r-partite graph structures

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/101772

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Cano Vila, María del Pilar
dc.contributor.author	Perarnau, Guillem
dc.contributor.author	Serra Albó, Oriol
dc.date	2016-10-03
dc.identifier.citation	Cano, M., Perarnau, G., Serra, O. Rainbow perfect matchings in r-partite graph structures. "Electronic notes in discrete mathematics", 3 Octubre 2016, vol. 54, p. 193-198.
dc.identifier.citation	1571-0653
dc.identifier.citation	10.1016/j.endm.2016.09.034
dc.identifier.uri	http://hdl.handle.net/2117/101772
dc.language.iso	eng
dc.relation	http://www.sciencedirect.com/science/article/pii/S1571065316301287
dc.relation	info:eu-repo/grantAgreement/ES/1PE/MTM2014-54754-P
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Combinatorial analysis
dc.subject	Graph theory
dc.subject	Rainbow matchings
dc.subject	Lovász Local lemma
dc.subject	Combinacions (Matemàtica)
dc.subject	Grafs, Teoria de
dc.subject	Classificació AMS::05 Combinatorics::05E Algebraic combinatorics
dc.subject	Classificació AMS::05 Combinatorics::05C Graph theory
dc.title	Rainbow perfect matchings in r-partite graph structures
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite multigraphs, dense regular bipartite graphs and complete r-partite r-uniform hypergraphs. The proof of the results use the Lopsided version of the Local Lovász Lemma.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author