Galvin–McKinley–Perkins–Sarantis–Tetali zero-free region conjecture for linear hypergraphs
Statement
Let be a hypergraph, where a hypergraph is -uniform if every edge has size , and linear if each pair of edges intersects in at most one vertex. An independent set is a set of vertices containing no edge, and its independence polynomial is
The maximum degree of is denoted by .
Galvin–McKinley–Perkins–Sarantis–Tetali conjecture. For each , there exists a constant such that, if is a -uniform linear hypergraph of maximum degree and
then
This conjecture proposes an improved zero-free region for the independence polynomial of linear hypergraphs. The paper's abstract states that it disproves this conjecture by constructing, for every , -uniform linear hypergraphs with arbitrarily large maximum degree having a root of modulus , so the conjecture is refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.