A Stability Theorem for Matchings in Tripartite 3-Graphs
| dc.contributor.author | Haxell, Penny | |
| dc.contributor.author | Narins, Lothar | |
| dc.date.accessioned | 2020-07-07T18:25:06Z | |
| dc.date.available | 2020-07-07T18:25:06Z | |
| dc.date.issued | 2018-04-02 | |
| dc.description.abstract | It 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.sponsorship | Natural Sciences and Engineering Research Council | en |
| dc.identifier.uri | https://doi.org/10.1017/s0963548318000147 | |
| dc.identifier.uri | http://hdl.handle.net/10012/16045 | |
| dc.language.iso | en | en |
| dc.publisher | Cambridge University Press | en |
| dc.subject | hypergraphs | en |
| dc.title | A Stability Theorem for Matchings in Tripartite 3-Graphs | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Haxell, 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.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.scholarLevel | Post-Doctorate | en |
| uws.typeOfResource | Text | en |