On the size of the product of overlapping families
From MaRDI portal
Publication:2084272
DOI10.2140/MOSCOW.2022.11.237zbMath1500.05060OpenAlexW4306290530MaRDI QIDQ2084272
Publication date: 18 October 2022
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/moscow.2022.11.237
Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- 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
- A new short proof for the Kruskal-Katona theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Families of finite sets with minimum shadows
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
- Proof of the Erdős matching conjecture in a new range
- Rainbow matchings for 3-uniform hypergraphs
- On the rainbow matching conjecture for 3-uniform hypergraphs
- On Erdős' extremal problem on matchings in hypergraphs
- The Size of a Hypergraph and its Matching Number
- On r-Cross Intersecting Families of Sets
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the size of graphs with complete-factors
- A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: On the size of the product of overlapping families
