Risk-minimizing GUE-implementations of truthful reporting in a Dynamic Social Choice Problem
Resumo indisponível. Consulte o paper original.
PAPER / ARXIV:2609.14470
Jing Huang
RESUMO
We prove the Erdős--Chvátal simplex conjecture across its entire parameter range. If $2\le d<k$ and $(d+1)k\le dv$, then every $d$-simplex-free family of $k$-subsets of $[v]$ has at most $\binom{v-1}{k-1}$ members, with equality only for a full star.
NO MESMO MAPA
Resumo indisponível. Consulte o paper original.