2 problems

Galvin–McKinley–Perkins–Sarantis–Tetali zero-free region conjecture for linear hypergraphs
Galvin–McKinley–Perkins–Sarantis–Tetali conjecture. For each $k\geq 2$ , there exists a constant $C_k>0$ such that, if $G$ is a $k$ -uniform linear hypergraph of maximum degree…
openFrom papershypergraph-polynomials independence-polynomials zero-free-regions
0 responses
5
Equality of hypergraph and graph zero-free loci
Zero-free locus conjecture. The zero-free locus of hypergraphs of maximum degree $\Delta$ is identical to the zero-free locus of graphs of maximum degree $\Delta$ :
openFrom paperscombinatorics hypergraph-polynomials zero-free-regions
0 responses
4

Galvin–McKinley–Perkins–Sarantis–Tetali zero-free region conjecture for linear hypergraphs