On the size of 3-uniform linear hypergraphs

DOI10.1016/J.DISC.2014.06.016MaRDI QIDQ396731zbMATHOpenAlexFDO

Authors Niraj Khare

Publication date 14 August 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.4791

zbMATH Keywords

matchinguniform hypergraphsmaximum degreelinear hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: 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 $mathcalF$ has maximum matching size $u$ and maximum degree $Delta$ such that $Deltageqfrac236u(1+frac1u-1)$, then $|mathcalF|leqDeltau$.

Recommendations

• On line graphs of linear 3-uniform hypergraphs
• 3-uniform hypergraphs and linear cycles
• 3-uniform hypergraphs and linear cycles
• Publication:4821199
• On 3-uniform hypergraphs without linear cycles
• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• On the feedback number of 3-uniform linear extremal hypergraphs
• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• The size of 3-uniform hypergraphs with given matching number and codegree
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites work

• scientific article; zbMATH DE number 3166040 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 970806 (Why is no real title available?)
• Degrees and matchings
• Graphs with restricted valency and matching number
• Improved bounds for Erdős' matching conjecture
• Intersection Theorems for Systems of Sets
• Matching theory
• Matchings and covers in hypergraphs
• The maximum size of 3-uniform hypergraphs not containing a Fano plane

Cited in

(10)

• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
• On 3-uniform hypergraphs without linear cycles
• On even-degree subgraphs of linear hypergraphs
• scientific article; zbMATH DE number 6503350 (Why is no real title available?)
• Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
• Shadow ratio of hypergraphs with bounded degree
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• The size of 3-uniform hypergraphs with given matching number and codegree
• The Turán number for the edge blow-up of trees

This page was built for publication: On the size of 3-uniform linear hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396731)