Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Address:
2
0
0
The largest families of loose spanning hypertrees containing a fixed $t$-edge forest are precisely those with maximally balanced component sizes, revealing a structural principle for extremal hypergraph intersections.
A tight $O(2^t)$ upper bound for the 2-color bipartite Ramsey number $b_2(t)$ is independently proven, refining previous results.