1 problem

Weighted occupancy-fraction conjecture for the distinct-activity Widom–Rowlinson model
Weighted occupancy-fraction conjecture. For any $\lambda_1,\lambda_2>0$ , the weighted occupancy fraction is maximised over all $d$ -regular graphs by $K_{d+1}$ .
Conjecturerefutedoccupancy-fractions regular-graphs widom-rowlinson-model
1

Weighted occupancy-fraction conjecture for the distinct-activity Widom–Rowlinson model