Location of Repository

FRACTIONAL AND INTEGER MATCHINGS IN UNIFORM HYPERGRAPHS

By Daniela Kühn, Deryk Osthus and Timothy Townsend

Abstract

Abstract. A conjecture of Erdős from 1965 suggests the minimum number of edges in a k-uniform hypergraph on n vertices which forces a matching of size t, where t ≤ n/k. Our main result verifies this conjecture asymptotically, for all t < 0.48n/k. This gives an approximate answer to a question of Huang, Loh and Sudakov, who proved the conjecture for t ≤ n/3k 2. As a consequence of our result, we extend bounds of Bollobás, Daykin and Erdős by asymptotically determining the minimum vertex degree which forces a matching of size t < 0.48n/(k − 1) in a k-uniform hypergraph on n vertices. We also obtain further results on d-degrees which force large matchings. In addition we improve bounds of Markström and Ruciński on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. Our approach is to inductively prove fractional versions of the above results and then translate these into integer versions. 1

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.372.5839
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://web.mat.bham.ac.uk/D.Os... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.