Show simple item record

dc.contributor.authorHaxell, Penny
dc.contributor.authorNarins, Lothar
dc.date.accessioned2020-07-07 18:25:06 (GMT)
dc.date.available2020-07-07 18:25:06 (GMT)
dc.date.issued2018-04-02
dc.identifier.urihttps://doi.org/10.1017/s0963548318000147
dc.identifier.urihttp://hdl.handle.net/10012/16045
dc.description.abstractIt follows from known results that every regular tripartite hypergraph of positive degree, with n vertices in each class, has matching number at least n/2. This bound is best possible, and the extremal configuration is unique. Here we prove a stability version of this statement, establishing that every regular tripartite hypergraph with matching number at most (1 + ϵ)n/2 is close in structure to the extremal configuration, where ‘closeness’ is measured by an explicit function of ϵ.en
dc.description.sponsorshipNatural Sciences and Engineering Research Councilen
dc.language.isoenen
dc.publisherCambridge University Pressen
dc.subjecthypergraphsen
dc.titleA Stability Theorem for Matchings in Tripartite 3-Graphsen
dc.typeArticleen
dcterms.bibliographicCitationHaxell, Penny, and Lothar Narins. “A Stability Theorem for Matchings in Tripartite 3-Graphs.” Combinatorics, Probability and Computing 27, no. 5 (September 2018): 774–93. https://doi.org/10.1017/S0963548318000147.en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Combinatorics and Optimizationen
uws.typeOfResourceTexten
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.scholarLevelPost-Doctorateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages