Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
The cochromatic number of G, denoted by ζ(G), is the minimum number of colours needed to colour the vertices of G such that each colour class induces either a complete graph or empty graph. Let χ(G) denote the chromatic number. If G is a…
Let d=d(n) be a real-valued function satisfying d(n)mathbinlongrightarrow+∞ as nmathbinlongrightarrow+∞. For integers n and i, let S_i(n,d(n)) denote the coefficient of t^i in Speyer's g-polynomial g_n,d(n)(t). Asymptotic normality…
Let M be a block matroid of rank n, meaning that its ground set is the disjoint union of two bases. Let G be the base-cobase graph of M: its vertices are the bases B for which the complement of B in the ground set is also a base, and two…
Let H be a strongly asymmetric graph on h vertices. Let i_H(n) be the maximum number of induced copies of H in an n-vertex graph, and let g(n,h) be the recursively defined nested-blowup count. Exact density conjecture. For every n∈N,…
Let G be a graph with n vertices and no isolated vertices. Let alpha(G) be its stability number, sigma_e(G)=omega_e(overline G) its edge-stable-set invariant, omega(G) its clique number, and omega_e(G) its edge-clique-covering number.…
Uniformly prove ∏_i=1^n ph+d_i/d_i = ∑_k=1^n binomp+1k Fact_k (c) by interpreting the right-hand side as fibers of the Lyashko-Looijenga map.
Let a and b be positive integers with a<b, and let M be a multiset of size ab. A multiset partition divides M into an unordered collection of submultisets. Weak Foulkes conjecture. The number of multiset partitions of M into b parts of…
Let G=(V,E) be an undirected graph, and r ∈ V a root node. G is called rooted (k,l)-connected if G-X is (k-vert Xvert)l-edge-connected for any X ⊆ V-r. Is it true that every rooted (k,l)-connected graph contains l edge-disjoint spanning…
Let M(n) be the number of distinct multinomial coefficients arising from partitions of n, and let p^*(n) be the total number of partitions of n into parts that are either at most 6 or multiples of 3 (or both). Lower-bound conjecture. For…
Let n be a natural number greater than three. A connected infinite locally finite graph is a graph with infinitely many vertices, finite vertex degrees, and a path between every pair of vertices; for a graph G, let D'(G) denote its…
Let d ≥ 2. A graph is a forbidden minor for d-flattenability when it is a minimal obstruction to d-flattenability. For an edge e of a graph G, (G ∖ e,e) denotes the graph-nonedge pair obtained by deleting e. Forbidden-minor SIP…
Question Does every matching of hypercube extend to a Hamiltonian cycle?
For a piece P with move set M, write hat d_r:=max(|c_r|,|d_r|). For a positive integer λ, let P^lcm_λ be the lcm-maximal piece whose move set consists of all moves (c,d) satisfying hat d|λ. Lcm-maximal piece conjecture. Among all pieces…
For tgeqslant 3, let S(t) be the set of good partitions considered in the paper, and for B∈ S(t) let n_00(B) denote the number of occurrences of 00 in B. Double-zero conjecture. For every B∈ S(t), n_00(B)<t. The claim is based on the…
Classify the finite simple graphs of minimum degree at least five whose cycle lengths fail to represent every residue class modulo five. Is residue two the only possible missing residue, and can all such graphs be characterized through an…
Let (X,μ) be a probability space and let (φ_n)_n≥ 1 be a complete uniformly bounded orthonormal system in L^2(X,μ), meaning that sup_nlVertφ_nrVert_∞<∞. The rearrangement assertion asks whether there always exists a permutation π of N such…
Is computation of a curve's zeta function polynomial simultaneously in the genus g and in log q?
Prove the collection of explicit conjectural evaluations, due to Cigler and to Cigler–Krattenthaler, for shifted Hankel determinants of Catalan-like sequences arising from weighted enumerations of nonintersecting Motzkin meanders. The…
Let G be a graph of order n with no isolated vertices. A graph is twin-free if no two distinct vertices have the same open or closed neighborhood, and let γ_L(G) be its location-domination number. Foucaud–Henning conjecture. Every…
Let G be a connected graph of order n, and let rd(G) be its rainbow disconnection number, the minimum number of colors needed in an edge-coloring so that every pair of vertices is separated by a rainbow edge-cut. Let k and n be integers…