On the size of 3-uniform linear hypergraphs

DOI10.1016/j.disc.2014.06.016zbMath1298.05237arXiv1304.4791OpenAlexW2078669540MaRDI QIDQ396731

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) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (2)

The size of 3-uniform hypergraphs with given matching number and codegree ⋮ The Turán number for the edge blow-up of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Graphs with restricted valency and matching number
• Matching theory
• Degrees and matchings
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• Matchings and covers in hypergraphs
• Intersection Theorems for Systems of Sets

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