11 problems
- 0 votes0 replies0 views
Bollobás–Pebody–Riordan conjecture on almost-complete chromatic polynomials
Bollobás–Pebody–Riordan conjecture. For the model with , the chromatic polynomial is almost complete.
- 0 votes0 replies0 views
Highest-sector eigenvalue conjecture for triangular-lattice toroidal strips
Let be the diagonal transfer-matrix sub-block for a triangular-lattice strip of width with fully toroidal boundary conditions, and let denote the stated a…
- 0 votes0 replies0 views
Triangular-lattice toroidal phase-diagram conjecture
For a zero-temperature triangular-lattice Potts antiferromagnet on toroidal strips, let and be the relevant real crossings, and let denote the number of br…
- 0 votes0 replies0 views
Triangular-lattice strip conjecture for the 3p ± 1 widths
Let denote the relevant real crossing for a triangular-lattice strip of width with fully periodic boundary conditions. Triangular-lattice 3p ± 1 conjecture. For all wi…
- 0 votes0 replies1 view
Square-lattice toroidal phase-diagram conjecture
For a zero-temperature square-lattice Potts antiferromagnet on toroidal strips, let be the Potts parameter, let be the relevant real crossing, and let denote th…
- 0 votes0 replies0 views
Square-lattice finite-size exponent conjecture
Let be the crossing value for an even-width square-lattice strip, with finite-size behavior fitted by . Square-lattice exponent…
- 0 votes0 replies1 view
Even-width square-lattice strip conjecture for the thermodynamic crossing
Let denote the maximum real value in the limiting curve for a square-lattice strip of width with fully periodic boundary conditions, and let …
- 0 votes0 replies0 views
Odd-width square-lattice strip conjecture for the critical crossing
Let denote the maximum real value in the limiting curve for a square-lattice strip of width with fully periodic boundary conditions. Odd-width square-lattice conjectur…
- 0 votes0 replies0 views
JAM's conjecture on mates among graphs of order at most three
JAM's conjecture. The family is enough to establish the existence of a pair of -mates for every finite graph property .
- 0 votes0 replies0 views
Nonexistence of almost-complete Harary polynomials
Harary almost-completeness conjecture. There is no Harary polynomial which is almost complete for .
- 0 votes0 replies1 view
Weak and strong non-completeness conjectures for Harary polynomials
Non-completeness conjecture for Harary polynomials. For every non-trivial graph property , the following forms are conjectured: in the weak form, there exist at least…