arXiv (All)
open access
On union-closed families with prescribed number of $k$-sets
Fix positive integers $N,k,n$ with $n\ge k$. We seek the minimum number of members of size at least $n$ in a finite family of finite sets closed under union and containing exactly $N$ distinct sets of size $k$. This problem is a specialization of the Leck--Roberts--Simpson weighted conjecture: assig
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ramsey Theory for Product Trees#1076554
- Deficit bounds and equality cases in the Tu--Deng problem#1122479
- Infinitely Many Binomial Coefficients of Deficiency One#1051535
- A Proof of the Imbalance Conjecture#615165
- A Proof of the Imbalance Conjecture#614198
Record · ID 998893
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive