Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let i=1,2 and let T_i=T_i(l_i) be finite labeled trees with non-degenerate labelings l_i:V(T_i)→R^+. Suppose that (V(T_1),d_l_1) and (V(T_2),d_l_2) are bf GH-spaces. For a space (V(T_i),d_l_i), let D(V(T_i)) denote its distance set.…
Find a higher-dimensional analogue of the paper's cropping and summation argument; in dimension three the expected sum ranges over quadruples v_1,v_2,v_3,v_4 for which ConvHull(0,v_1,v_2,v_3,v_4) contains no lattice points.
Let c1_2,3(s,n) denote the quantity counting the relevant continuous multiline-queue configurations, let N be the total size parameter used in the paper, and let f_(s,s) denote the relevant hook-length count. The conjectural formula.…
A brace is a bipartite matching covered graph, and a graph is cycle-conformal if every even cycle C has the property that deleting its vertices leaves a graph with a perfect matching. A complete bipartite graph is a graph of the form…
For a graph G, a linear forest is a forest whose components are paths, and the linear arboricity la(G) is the minimum number of disjoint linear forests whose union contains all edges of G. Let Δ be the maximum degree of G. Akiyama's linear…
Let G be a graph, let S=K[x_1,…,x_n,y_1,…,y_n], and let J_G be its binomial edge ideal. Denote by r the number of maximal cliques of G. Sārā's conjecture. reg(S/J_G)≤ r. This conjecture seeks to bound the regularity of a binomial edge…
Let d-regular graphs be graphs in which every vertex has degree d, and call a partition of the vertex set into two parts an internal partition when every vertex has at least as many neighbors in its own part as in the other part. Ban and…
Inverse theorem for equilateral triangles on the sphere Denote by S^n⊂ R^n+1 the unit sphere. For a function f:S^n→ R, define the quantity Tf:= E_x,y,z∈ S^n,x+y+z=0 f(x)f(y)f(z). If f is 1-bounded and |Tf|>δ, does f correlate with a…
Problem 2.10. Suppose A is a subset of the naturals, and is an additive basis of N of order 2. Does there exist a proper subset B of A, where B is an additive basis of the naturals of order 2? What is the slowest growing B(x):= |{ b ∈ B: b…
Let d≥ 3 be an integer and let G be a connected graph of order n≥ d+1. For S⊆ V(G), let i(G-S) denote the number of isolated vertices in G-S. Kaneko's conjecture. If i(G-S)<2|S|/d-2 for every nonempty subset S⊆ V(G), then G has a spanning…
Let G=(Auplus B,E) be a bipartite linklessly embeddable graph, and let < be a (3,3)-admissible order. Write G^b for the balanced shift of G. Bipartite linkless-embeddability conjecture. If |A|,|B|≥ 4, then K_4,4^- is not a subgraph of G^b,…
A positive integer n is constructible on trees if there exists a tree T such that i(T)=n, where i(T) denotes the number of independent sets in T. Li–Li–Wang's conjecture. There are only finitely many positive integers that are not…
Compactness implies that for every ε>0 there is K>0 such that every finite graph can be approximated within error ε by a finite graph of size K. Give an estimate for K in terms of ε.
Let M^d(n) denote the maximum percolation time in two-dimensional bootstrap percolation on the d-dimensional grid [n]^d. For fixed d≥ 1, the conjecture is M^d(n)=6d^2-5d-1/18n^2+O(n). Benevides–Griffiths–Przykucki conjecture. For all fixed…
Let G be a bipartite graph with n users and m=nk-r edges, where 0≤ r≪ n. Let H(n,m) be the corresponding partition graph. A user is de-anonymized by an optimizing attacker by revealing its identity, and the remaining perfect matchings are…
Let C_m,n be the square-grid cylinder, let Q_2 be the class of configurations specified in the surrounding construction, and let π be the associated projection map. For σ∈ Q_2, consider all τ with π(τ)=π(σ). Vanishing matching-sum…
Let G be a graph. A graph is weakly semiregular if there are two numbers a,b such that every vertex has degree a or b. A subgraph is locally irregular if adjacent vertices have distinct degrees. Three-subgraph conjecture. Every graph can…
Let K_n be the complete graph on n vertices. For an integer m, let J(n,m) be the set of primes pleqslant m for which K_n is a Legendre cordial graph modulo p, and let J(n,m)=|J(n,m)|. Asymptotic scarcity conjecture. For any integer m,…
Throughout, all vectors and matrices are over F_2. Fix sgeqslant 2 and let M=[v_0,…,v_2^s-1-1] be an s× 2^s-1 matrix with nonzero columns. Let H=[h_0,…,h_2^s-1] be an s× 2^s matrix whose columns are precisely the vectors of F_2^s, each…
Conjecture Every sufficiently large plane triangulation G has a dominating set of size ≤ 1/4 |V(G)|.