Article Instance

HTTP 200 OK
Allow: GET
Content-Type: application/json
Vary: Accept

{
    "pk": 64968,
    "title": "Matchings in multipartite hypergraphs",
    "subtitle": null,
    "abstract": "A folklore result on matchings in graphs states that if \\(G\\) is a bipartite graph whose vertex classes \\(A\\) and \\(B\\) each have size \\(n\\), with \\(\\deg(u) \\geq a\\) for every \\(u \\in A\\) and \\(\\deg(v) \\geq b\\) for every \\(v \\in B\\), then \\(G\\) admits a matching of size \\(\\min\\{n, a+b\\}\\). In this paper we establish the analogous result for large \\(k\\)-partite \\(k\\)-uniform hypergraphs, answering a question of Han, Zang and Zhao, who previously demonstrated that this result holds under the additional condition that the minimum degrees into at least two of the vertex classes are large. A key part of our proof is a study of rainbow matchings under a combination of degree and multiplicity conditions, which may be of independent interest.\n \nMathematics Subject Classifications: 05C65, 05C70\n \nKeywords: Matchings, Hypergraphs",
    "language": "en",
    "license": {
        "name": "Creative Commons Attribution 4.0",
        "short_name": "CC BY 4.0",
        "text": "Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.\n\nNo additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.",
        "url": "https://creativecommons.org/licenses/by/4.0"
    },
    "keywords": [
        {
            "word": "Matchings"
        },
        {
            "word": "Hypergraphs"
        }
    ],
    "section": "Research Articles",
    "is_remote": true,
    "remote_url": "https://escholarship.org/uc/item/5fs3g2js",
    "frozenauthors": [
        {
            "first_name": "Candida",
            "middle_name": "",
            "last_name": "Bowtell",
            "name_suffix": "",
            "institution": "School of Mathematics, University of Birmingham, Birmingham, U.K.",
            "department": ""
        },
        {
            "first_name": "Richard",
            "middle_name": "",
            "last_name": "Mycroft",
            "name_suffix": "",
            "institution": "School of Mathematics, University of Birmingham, Birmingham, U.K.",
            "department": ""
        }
    ],
    "date_submitted": "2025-03-14T16:37:07Z",
    "date_accepted": "2025-03-14T16:37:07Z",
    "date_published": "2025-03-15T07:00:00Z",
    "render_galley": null,
    "galleys": [
        {
            "label": "",
            "type": "pdf",
            "path": "https://journalpub.escholarship.org/combinatorial_theory/article/64968/galley/49778/download/"
        }
    ]
}