2013/04/17 by Niraj Khare, Khare, Niraj
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1304.4791
20 pages
arxiv created 2013/04/17 · arxiv updated 2013/04/18
This article provides bounds on the size of a 3-uniform linear hypergraph with restricted matching number and maximum degree. In particular, we show that if a 3-uniform, linear family F has maximum matching size ν and maximum degree Δ such that Δ≥ (23)/(6)ν(1+(1)/(ν-1)), then |F|≤ Δν.