Erdős matching conjecture for almost perfect matchings
From MaRDI portal
Publication:2685338
DOI10.1016/J.DISC.2022.113304OpenAlexW4313568135WikidataQ123161001 ScholiaQ123161001MaRDI QIDQ2685338
Andrey B. Kupavskii, Dmitriy Kolupaev
Publication date: 21 February 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.01526
Related Items (1)
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 the maximum number of edges in a hypergraph with given matching number
- Proof of the Erdős matching conjecture in a new range
- The Erdős matching conjecture and concentration inequalities
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- The Size of a Hypergraph and its Matching Number
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
This page was built for publication: Erdős matching conjecture for almost perfect matchings