89 problems
- 0 votes0 replies0 views
Birkhoff–Lewis conjecture for colorings of planar graphs
Let be a planar graph with vertices, let denote its coloring polynomial, and let be a real number with . Birkhoff–Lewis conjecture. For every such gra…
- 0 votes0 replies1 view
Tomescu's conjecture on chromatic polynomials of connected graphs
Let be a connected graph on vertices with chromatic number , and let denote its chromatic polynomial, the number of proper -colorings. Let…
- 0 votes0 replies1 view
Sokal's bounded-degree chromatic-zero half-plane conjecture
Let be an integer. Consider graphs all of whose vertices have degree at most , except possibly one vertex, and let denote the chromatic polynomial o…
- 0 votes0 replies0 views
Beraha's conjecture on chromatic roots near Beraha numbers
Let be a graph, and let denote its chromatic polynomial, whose roots are called chromatic roots. The Beraha numbers are the numbers … A planar triangulation is a plana…
- 0 votes0 replies0 views
Read's unimodality conjecture for chromatic-polynomial coefficients
Let be a finite graph and let be its chromatic polynomial. Read's conjecture. The absolute values of the coefficients of are unimodal. This conjecture w…
- 0 votes0 replies1 view
Bartels–Welsh shameful conjecture for the chromatic polynomial
Let be an -vertex graph, and let denote its chromatic polynomial. The mean color number is the average number of colors used in all -colorings of . B…
- 0 votes0 replies0 views
Royle's extremal chromatic-root conjecture for complete bipartite graphs
Let be a graph of maximum degree , with , and let denote the complete bipartite graph with vertices in each part. A chromatic…
- 0 votes0 replies0 views
Linear chromatic-root bound in maxmaxflow
Maxmaxflow chromatic-root conjecture. There exist universal constants such that every chromatic root of every loopless graph of maxmaxflow lies in
- 0 votes0 replies1 view
Shrock–Tsai bounded-zero-set conjecture for graphs of bounded edge-connectivity
Let be a class of finite graphs and let be a subset of the complex plane. For a graph with edge weights , let … For and distinct…
- 0 votes0 replies1 view
The Farrell conjecture on the real parts of chromatic zeros
Farrell's conjecture. Every chromatic zero satisfies
- 0 votes0 replies0 views
Unit-disk conjecture for chromatic zeros of square- and triangular-lattice strips
Unit-disk conjecture. For these strips, there are no chromatic zeros satisfying
- 0 votes0 replies1 view
Global-circuit conjecture for negative-real-part chromatic zeros of lattice strips
Global-circuit conjecture. Global circuits are a necessary condition for lattice strips to have chromatic zeros and, in the limit , a locus with support fo…
- 0 votes0 replies2 views
Dong–Ge–Gong–Ning–Ouyang–Tay higher-derivative conjecture for chromatic polynomials
Let be a graph of order , and let denote its chromatic polynomial. For , the quantity is positive, so its logarithm is defined. Dong–Ge–Gong–Nin…
- 0 votes0 replies0 views
Positivity of the chromatic polynomial above maxmaxflow
Let be a loopless graph with maxmaxflow , and let be its chromatic polynomial. Maxmaxflow chromatic positivity conjecture. For every real , … In pa…
- 0 votes0 replies0 views
Nonnegative derivatives of the chromatic polynomial at maxmaxflow
Let be a loopless graph with maxmaxflow , and let be its chromatic polynomial. Maxmaxflow derivative-positivity conjecture. The polynomial and all…
- 0 votes0 replies0 views
Sokal's bounded-edge-connectivity conjecture for chromatic roots
Let be a graph and let be the maximum number of edge-disjoint paths joining any pair of vertices of . Sokal's conjecture. There exists a constant such that…
- 0 votes0 replies1 view
Salas–Sokal conjecture for planar bipartite graphs
Let be a planar bipartite graph, and let be its chromatic polynomial. Let be the golden ratio. Salas–Sokal conjecture. … Equivalently, planar bip…
- 0 votes0 replies0 views
Woodall's conjectures on chromatic roots of highly connected plane triangulations
A plane triangulation is a loopless plane graph in which every face has size three. Let be its chromatic polynomial, let be the golden ratio, and let…
- 0 votes0 replies0 views
Thomassen's conjecture for chromatic roots of 3-connected graphs
Let be a loopless 3-connected graph with vertices, and let be its chromatic polynomial. Let be the chromatic root of in . Th…
- 0 votes0 replies1 view
Brown–Hickman–Sokal–Wagner conjecture on extremal chromatic roots of generalized theta graphs
Extremal generalized-theta conjecture. For every , the -ary generalized theta graph whose chromatic root maximizes is , the graph with all path le…
- 0 votes0 replies0 views
The completeness conjecture for partition [21] eigenvalues of toroidal chains
Let denote the toroidal chain of complete graphs with parameter , and let denote the corresponding eigenvalues indexed by . Consider the four…
- 0 votes0 replies0 views
Conjecture (1b) on the limiting nonanalytic locus of regular lattice graphs
Let be a regular lattice graph with no global circuits, let tend to infinity, and let denote the resulting set of points in the complex -plane. Conjectur…
- 0 votes0 replies1 view
Conjecture (1a) on chromatic zeros of regular lattice graphs without global circuits
Let be a regular lattice graph with no global circuits, and let be a chromatic zero of . Conjecture (1a). One has , and the only chromatic zero with…
- 0 votes0 replies0 views
Regular-lattice analyticity conjecture for reduced chromatic functions
Let be a graph family with limiting ground-state degeneracy per vertex … and define its reduced function by . Let be a regular lattice…
- 0 votes0 replies1 view
Cylindrical-strip Beraha-zero pattern conjecture
Let be the width of a triangular-lattice strip with cylindrical boundary conditions, let denote the Beraha numbers, and let be the amplitude matrix. Cylindrical-st…