Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs

Tools
- Tools
+ Tools

Bowtell, Candida and Hyde, Joseph (2022) A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs. SIAM Journal on Discrete Mathematics, 36 (2). pp. 1038-1063. doi:10.1137/20M1364825 ISSN 0895-4801.

[img]
Preview
PDF
WRAP-degree-sequence-strengthening-vertex-degree-threshold-perfect-matching-3-uniform-hypergraphs-2022.pdf - Published Version - Requires a PDF viewer.

Download (660Kb) | Preview
Official URL: http://dx.doi.org/10.1137/20M1364825

Request Changes to record.

Abstract

The study of asymptotic minimum degree thresholds that force matchings and tilings in hypergraphs is a lively area of research in combinatorics. A key breakthrough in this area was a result of Hàn, Person, and Schacht [SIAM J. Disc. Math., 23 (2009), pp. 732--748] who proved that the asymptotic minimum vertex degree threshold for a perfect matching in an $n$-vertex $3$-graph is $\left(\frac{5}{9}+o(1)\right)\binom{n}{2}$. In this paper, we improve on this result, giving a family of degree sequence results, all of which imply the result of Hàn, Person and Schacht and additionally allow one-third of the vertices to have degree $\frac{1}{9}\binom{n}{2}$ below this threshold. Furthermore, we show that this result is, in some sense, tight.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Combinatorial analysis , Graph theory , Hypergraphs
Journal or Publication Title: SIAM Journal on Discrete Mathematics
Publisher: Society for Industrial and Applied Mathematics
ISSN: 0895-4801
Official Date: 19 April 2022
Dates:
DateEvent
19 April 2022Available
3 November 2021Accepted
Volume: 36
Number: 2
Page Range: pp. 1038-1063
DOI: 10.1137/20M1364825
Status: Peer Reviewed
Publication Status: Published
Reuse Statement (publisher, data, author rights): First Published in SIAM Journal on Discrete Mathematics in 36 (2). 2022., published by the Society for Industrial and Applied Mathematics (SIAM) Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 6 July 2022
Date of first compliant Open Access: 6 July 2022
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
947978Horizon 2020 Framework Programmehttp://dx.doi.org/10.13039/100010661
MR/S016325/1UK Research and Innovationhttp://dx.doi.org/10.13039/100014013

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us