DC Field | Value | Language |
---|---|---|
dc.contributor.author | Clemens, Dennis | - |
dc.contributor.author | Ehrenmüller, Julia | - |
dc.date.accessioned | 2020-04-28T18:30:44Z | - |
dc.date.available | 2020-04-28T18:30:44Z | - |
dc.date.issued | 2016-04-15 | - |
dc.identifier.citation | Electronic Journal of Combinatorics 2 (23): P2.11 (2016-04-15) | de_DE |
dc.identifier.issn | 2156-3527 | de_DE |
dc.identifier.uri | http://hdl.handle.net/11420/5949 | - |
dc.description.abstract | A 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.iso | en | de_DE |
dc.relation.ispartof | The journal of combinatorics | de_DE |
dc.subject | Bipartite graphs | de_DE |
dc.subject | Rainbow matchings | de_DE |
dc.title | An improved bound on the sizes of matchings guaranteeing a rainbow matching | de_DE |
dc.type | Article | de_DE |
dc.type.dini | article | - |
dcterms.DCMIType | Text | - |
tuhh.abstract.english | A 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.institute | Mathematik E-10 | de_DE |
tuhh.type.opus | (wissenschaftlicher) Artikel | - |
dc.type.driver | article | - |
dc.type.casrai | Journal Article | - |
tuhh.container.issue | 2 | de_DE |
tuhh.container.volume | 23 | de_DE |
tuhh.container.articlenumber | P2.11 | de_DE |
datacite.resourceType | Journal Article | - |
datacite.resourceTypeGeneral | Text | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.creatorGND | Clemens, Dennis | - |
item.creatorGND | Ehrenmüller, Julia | - |
item.openairetype | Article | - |
item.fulltext | No Fulltext | - |
item.cerifentitytype | Publications | - |
item.creatorOrcid | Clemens, Dennis | - |
item.creatorOrcid | Ehrenmüller, Julia | - |
item.languageiso639-1 | en | - |
item.mappedtype | Article | - |
crisitem.author.dept | Mathematik E-10 | - |
crisitem.author.dept | Mathematik E-10 | - |
crisitem.author.orcid | 0000-0001-5940-6556 | - |
crisitem.author.parentorg | Studiendekanat Elektrotechnik, Informatik und Mathematik | - |
crisitem.author.parentorg | Studiendekanat Elektrotechnik, Informatik und Mathematik | - |
Appears in Collections: | Publications without fulltext |
Add Files to Item
Note about this record
Export
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.