1. TUHH Open Research (TORE)
  2. TUHH
  3. Publications without fulltext
DC FieldValueLanguage
dc.contributor.authorClemens, Dennis-
dc.contributor.authorEhrenmüller, Julia-
dc.date.accessioned2020-04-28T18:30:44Z-
dc.date.available2020-04-28T18:30:44Z-
dc.date.issued2016-04-15-
dc.identifier.citationElectronic Journal of Combinatorics 2 (23): P2.11 (2016-04-15)de_DE
dc.identifier.issn2156-3527de_DE
dc.identifier.urihttp://hdl.handle.net/11420/5949-
dc.description.abstractA conjecture by Aharoni and Berger states that every family of n matchings of size n + 1 in a bipartite multigraph contains a rainbow matching of size n. In this paper we prove that matching sizes of (3/2 + o(1))n suffice to guarantee such a rainbow matching, which is asymptotically the same bound as the best-known one in the case where we only aim to find a rainbow matching of size n – 1. This improves previous results by Aharoni, Charbit and Howard, and Kotlar and Ziv.en
dc.language.isoende_DE
dc.relation.ispartofThe journal of combinatoricsde_DE
dc.subjectBipartite graphsde_DE
dc.subjectRainbow matchingsde_DE
dc.titleAn improved bound on the sizes of matchings guaranteeing a rainbow matchingde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.abstract.englishA conjecture by Aharoni and Berger states that every family of n matchings of size n + 1 in a bipartite multigraph contains a rainbow matching of size n. In this paper we prove that matching sizes of (3/2 + o(1))n suffice to guarantee such a rainbow matching, which is asymptotically the same bound as the best-known one in the case where we only aim to find a rainbow matching of size n – 1. This improves previous results by Aharoni, Charbit and Howard, and Kotlar and Ziv.de_DE
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.issue2de_DE
tuhh.container.volume23de_DE
tuhh.container.articlenumberP2.11de_DE
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.creatorGNDClemens, Dennis-
item.creatorGNDEhrenmüller, Julia-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.creatorOrcidClemens, Dennis-
item.creatorOrcidEhrenmüller, Julia-
item.languageiso639-1en-
item.mappedtypeArticle-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0001-5940-6556-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

56
Last Week
1
Last month
0
checked on Aug 15, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.