On the Maximum Number of Edges in a Hypergraph with Given Matching\n Number

2012/05/30 by Péter Frankl, Frankl, Peter · 8 citations
Computer Science · Mathematics · #05C65 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1205.6847

openalex publication_date 2012/05/30 · openalex created_date 2022/09/21 · openalex updated_date 2026/07/28

Abstract

The aim of the present paper is to prove that the maximum number of edges in\na 3-uniform hypergraph on n vertices and matching number s is\nmax binom(3s+2,3), binom(n,3) - binom(n-s,3) for all n,s, n >= 3s+2.\n

Cited by

• Tensor Spectral Stability for Uniform Hypergraphs with Bounded Matching Number
• A complete solution of the Erdős-Kleitman matching problem for n≤ 3s
• Triple systems with bounded matching number: some constructions and exact Turán number
• Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions
• Sharp asymptotic bounds for uniform union-free hypergraphs
• An analogue of the Erd\H os Matching Conjecture for permutations with fixed number of cycles
• The (p,q)-extremal problem and the fractional chromatic number of Kneser\n hypergraphs
• The structure of large intersecting families

Related

• On the Maximum Number of Edges in a Hypergraph with a Unique Perfect\n Matching
• On the Maximum Number of Edges in Hypergraphs with Fixed Matching and Clique Number
• The size of a hypergraph and its matching number
• On 3-uniform hypergraphs avoiding a cycle of length four
• Perfect matching in 3-uniform hypergraphs with large vertex degree