A generalization of Erdős' matching conjecture

zbMath1391.05210arXiv1710.04633MaRDI QIDQ1753109

Israel Rocha, Christos Pelekis

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsErdős matching conjecturecomplete intersection theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• Around the complete intersection theorem
• The complete intersection theorem for systems of finite sets
• Invitation to intersection problems for finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Proof of the Erdős matching conjecture in a new range
• On maximal tail probability of sums of nonnegative, independent and identically distributed random variables
• On Erdős' extremal problem on matchings in hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• How to Poison Your Mother-in-Law, and Other Caching Problems
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• A generalization of Tuza's conjecture

This page was built for publication: A generalization of Erdős' matching conjecture