arXiv (All)
open access
Beyond Liu's 0.382709 threshold for the union-closed sets conjecture
The union-closed sets conjecture asks whether every finite union-closed family containing a nonempty set has an element contained in at least half of its members. Let $c_{\mathrm{UC}}$ denote the largest universal lower bound on this proportion. The best previously proved lower bound is due to Liu a
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
- Probabilities of Conditionals and Conditional Probabilities — Revisited#85422
- On a total version of 1-2-3 Conjecture#229846
- Adjunctions, Box Products, and Forcing Families#1049605
- Sharp Edge-Edit Bounds at Every Level for Leaky Positive Semidefinite Forcing#1037487
- Cut-conditions on sets of multiple-alternative inferences#88965
Record · ID 1186609
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