Equality of hypergraph and graph zero-free loci
Statement
For a positive integer , let be the maximal simply connected open subset of containing that is zero-free for the independence polynomials of all graphs of maximum degree . Let be the analogous set for -uniform hypergraphs, and let be the analogous set for hypergraphs whose edge sizes are at least . Thus .
Zero-free locus conjecture. The zero-free locus of hypergraphs of maximum degree is identical to the zero-free locus of graphs of maximum degree :
This asks whether allowing arbitrary edge sizes gives no smaller zero-free locus than graphs. The paper notes that its general zero-free disk theorem gives a disk of radius inside , but the equality of the full loci remains open.
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.