arXiv (All)
open access
Typical intersecting families at $n=2k+1$ and $n=2k+2$
A family of sets is intersecting if every two members intersect, and trivial if all its members contain a common element. We determine the typical structure of $k$-uniform intersecting families on $2k+1$ and $2k+2$ elements as $k\to\infty$. For $n=2k+2$, we prove that almost all intersecting familie
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
- Characterizing optimal monitoring edge-geodetic sets for some structured graph classes#14161
- Backtracking Candidate Elimination: A One-Pass Algorithm for the Chip Testing Problem#1063206
- A Near-Linear Element Kernel for \(d\)-Hitting Set#974083
- A Simple Construction of Locally Checkable Problems Filling the LOCAL Complexity Gaps in Graphs with Arbitrary Large Degrees#971857
- Computing the Internet checksum#134837
Record · ID 1157467
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