Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
EnglishFrançais
Combinatorics, Probability and Computing Combinatorics, Probability and Computing

Article contents

A Stability Theorem for Matchings in Tripartite 3-Graphs

Part of: Graph theory Extremal combinatorics

Published online by Cambridge University Press:  02 April 2018

PENNY HAXELL  and
LOTHAR NARINS
PENNY HAXELL
Affiliation:
Combinatorics and Optimization Department, University of Waterloo, Waterloo, ON, CanadaN2L 3G1 (e-mail: pehaxell@uwaterloo.ca)
LOTHAR NARINS
Affiliation:
Combinatorics and Optimization Department, University of Waterloo, Waterloo, ON, CanadaN2L 3G1 (e-mail: pehaxell@uwaterloo.ca)
Corresponding
E-mail address:
pehaxell@uwaterloo.ca
Get access
Rights & Permissions[Opens in a new window]

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 ϵ.

MSC classification

Primary: 05C65: Hypergraphs
Secondary: 05C70: Factorization, matching, partitioning, covering and packing 05D15: Transversal (matching) theory
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 27 , Issue 5 , September 2018 , pp. 774 - 793
Copyright
Copyright © Cambridge University Press 2018 

Access options

Get access to the full version of this content by using one of the access options below.
If you should have access and can't see this content please contact technical support.

Footnotes

†

Partially supported by NSERC. This author also thanks the Mittag-Leffler Institute in Djursholm, Sweden, where part of this work was done.

References

[1] Adamaszek, M. and Barmak, J. A. (2011) On a lower bound for the connectivity of the independence complex of a graph. Discrete Math. 311 2566–2569.CrossRefGoogle Scholar
[2] Aharoni, R. (2001) Ryser's conjecture for tripartite 3-graphs. Combinatorica 21 1–4.CrossRefGoogle Scholar
[3] Aharoni, R., Alon, N., Amir, M., Haxell, P., Hefetz, D., Jiang, Z., Kronenberg, G. and Naor, A. (2017) Ramsey-nice families of graphs. arXiv:1708.07369Google Scholar
[4] Aharoni, R. and Berger, E. (2006) The intersection of a matroid and a simplicial complex. Trans. Amer. Math. Soc. 358 4895–4917.CrossRefGoogle Scholar
[5] Aharoni, R., Berger, E. and Ziv, R. (2007) Independent systems of representatives in weighted graphs. Combinatorica 27 253–267.CrossRefGoogle Scholar
[6] Aharoni, R. and Haxell, P. (2000) Hall's theorem for hypergraphs. J. Graph Theory 35 83–88.3.0.CO;2-V>CrossRefGoogle Scholar
[7] Alon, N. and Kim, J. H. (1997) On the degree, size, and chromatic index of a uniform hypergraph. J. Combin. Theory Ser. A 77 165–170.CrossRefGoogle Scholar
[8] Haxell, P., Narins, L. and Szabó, T. Extremal hypergraphs for Ryser's conjecture. J. Combin. Theory Ser. A, to appearGoogle Scholar
[9] Meshulam, R. (2003) Domination numbers and homology. J. Combin. Theory Ser. A 102 321–330.CrossRefGoogle Scholar
[10] Milnor, J. (1956) Construction of universal bundles, II. Ann. of Math. 63 430–436.CrossRefGoogle Scholar
[11] Narins, L. (2014) Extremal hypergraphs for Ryser's conjecture. PhD thesis, Freie Universität Berlin.Google Scholar
[12] Ryser, H. (1967) Neuere Probleme der Kombinatorik. In Vorträge über Kombinatorik Oberwolfach, Mathematisches Forschungsinstitut Oberwolfach, Colloquia Mathematica Societatis János Bolyai, pp. 69–91.Google Scholar
[13] Sperner, E. (1928) Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes. Abh. Math. Sem. Univ. Hamburg 6 265–272.CrossRefGoogle Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 64 *
View data table for this chart

* Views captured on Cambridge Core between 02nd April 2018 - 16th January 2021. This data will be updated every 24 hours.

Hostname: page-component-77fc7d77f9-fgqm6 Total loading time: 0.221 Render date: 2021-01-16T09:49:00.849Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags last update: Sat Jan 16 2021 08:53:28 GMT+0000 (Coordinated Universal Time) Feature Flags: { "metrics": true, "metricsAbstractViews": false, "peerReview": true, "crossMark": true, "comments": true, "relatedCommentaries": true, "subject": true, "clr": true, "languageSwitch": true, "figures": false, "newCiteModal": false, "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

A Stability Theorem for Matchings in Tripartite 3-Graphs
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

A Stability Theorem for Matchings in Tripartite 3-Graphs
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

A Stability Theorem for Matchings in Tripartite 3-Graphs
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *