Conceptio › Archive › arXiv (All)
arXiv (All) open access

A Proof of Füredi's Conjecture

Huang, Zihao et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
combinatorics
We prove Füredi's conjecture on strong Bollobás $t$-systems. For every nonnegative integer $t$, a family of $m\ge2$ pairs of finite sets $(A_i,B_i)$ satisfying $|A_i\cap B_i|\le t$ and $|A_i\cap B_j|>t$ for all $i\ne j$ satisfies \[ \sum_i\binom{|A_i|+|B_i|-2t}{|A_i|-t}^{-1}\le1. \] We first prove
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

Record · ID 999431
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