223 problems
Fix . Let be an i.i.d. initial mass configuration for the divisible sandpile, with mean density , and let…
For every infinite, locally finite, transitive graph , let denote Bernoulli bond percolation with parameter , let , and define…
Higher-dimensional max-flow min-cut conjecture. There exists a map on the unit sphere such that, for every convex set with in its interior,
Let be a finite connected graph and let . The bunkbed graph has vertex set , two horizontal copies of every edge of , and a vertical…
Tile the unit square by, possibly infinitely many, squares of varying sizes, with at most three squares meeting at any corner. Color each square black or white independently, each…
Critical-percolation conjecture.
Let be a finite graph, let denote the spectral radius of its adjacency matrix, and let be obtained from by retaining each edge independently with probabi…
Let be an infinite, connected, transitive, simple graph of vertex degree that is not one-dimensional, and let be its Bernoulli bond percolation critical probabilit…
Let be an undirected graph, and let and be two copies of . For each , write and for its copies, and form the bunkbed graph…
Random-current sharp-transition conjecture. The single random current on has a unique sharp percolative phase transition, namely
Let be a bounded-degree plane triangulation. Write for site percolation on in which each vertex is retained independently with probability . The graph is…
Let be the critical function for anisotropic bond percolation, and let denote the critical parameter for -dimensional percolation. Write…
Schramm's locality conjecture. Then
Strict -to- threshold conjecture. For every ,
Let and . For the random-cluster model on , let and be the infinite-volume random-cluster measures with free and wire…
Let be a simply connected domain in the complex plane, and let be boundary points in counterclockwise order. Suppose that is conformally equivalent to the equilat…
The bunkbed conjecture for transitive tournaments. The statement
Consider the infinite connected components of the corner-percolation configuration, each assigned its integer-valued level. Level-bijection conjecture. The function which maps each…
Let be a sequence of finite, connected, vertex-transitive graphs with vertex degree diverging as . For a fixed sequence and fixed ,…
Monotonicity conjecture. For ,
Häggström–Pemantle's conjecture. In every dimension , infinite coexistence has positive probability if and only if the infection intensities are equal:
Let and let be an -vertex size rule. Define as the supremum of the set of for which the suscept…
Let and be groups with Cayley graphs whose asymptotic cones are isometric. A group is non-elementary hyperbolic if it is hyperbolic and is not virtually cyclic. Sapir's co…
Commuting infinite subgroups conjecture. The group contains two infinite subgroups and which commute with each other:
Consider the competition process on with blue and yellow infections, whose transmission parameters are and , respectively. Let be…