arXiv (All)
open access
Three-Layer Intersecting Temperate Families
In response to a conjecture of Petr and Turek, we prove that every largest intersecting temperate collection of sets $\mathcal{A}\subseteq [2k]^{(k)}\cup [2k]^{(k+1)}\cup [2k]^{(k+2)}$ includes all $k$-sets containing some given $a\in[2k]$, all $(k+1)$-sets, and all $(k+2)$-sets not containing $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
- The Remaining $K_4$-Free Case in the Multipartite Clique Problem#1013778
- Minimal Covering Bodies and a Minkowski-Type Criterion for Lattice Coverings#1083115
- Capacitated Partition Vertex Cover and Partition Edge Cover#1129149
- Curves of constant width and Lebesgue's covering problem#820693
- Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem#1117643
Record · ID 1051150
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