2 problems

0 votes0 replies0 views
The family-level tower lower-bound conjecture for tightly connected hypergraphs
The family-level tower lower-bound conjecture. If $k>s$ , then there exists a positive constant $c$ such that
Conjectureopenhypergraph-ramsey tower-functions uniform-hypergraphsarXiv posted 2 days ago
0 votes0 replies0 views
The tower lower-bound conjecture for tightly connected hypergraph Ramsey numbers
The tower lower-bound conjecture. If $k>s$ and $H$ is an $s$ -tightly connected $k$ -graph that is not $k$ -partite, then there exists a positive constant $c$ such that
Conjectureopenhypergraph-ramsey tower-functions uniform-hypergraphsarXiv posted 2 days ago

The family-level tower lower-bound conjecture for tightly connected hypergraphs