Beyond the Erdős matching conjecture

DOI10.1016/j.ejc.2021.103338zbMath1466.05206arXiv1901.09278OpenAlexW2919920323WikidataQ113875502 ScholiaQ113875502MaRDI QIDQ2033940

Andrey B. Kupavskii, Peter Frankl

Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theorem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

A note on exact minimum degree threshold for fractional perfect matchings ⋮ Rainbow version of the Erdős Matching Conjecture via concentration ⋮ A proof of Frankl's conjecture on cross-union families ⋮ A proof of Frankl–Kupavskii's conjecture on edge‐union condition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the maximum number of edges in a hypergraph with given matching number
• The complete intersection theorem for systems of finite sets
• Beyond the Erdős-Ko-Rado theorem
• Families of finite sets satisfying a union condition
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• The Size of a Hypergraph and its Matching Number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the size of graphs with complete-factors
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Intersection theorems for systems of finite sets

This page was built for publication: Beyond the Erdős matching conjecture