Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let T be a tree, let (T) denote its independent locating-dominating number, and let _l(T) denote its locating-dominating number. Characterization problem. Characterize those trees T for which ι(T)=γ_l(T). The paper identifies this as an…
Conjecture If G is a 3-connected planar graph, then Gsquare K_2 has a Hamilton cycle.
Let T be a tree, let Δ and k be positive integers, and let H be a graph with chromatic number χ(H)=k. A graph T is H-good if its Ramsey number with H satisfies r(T,H)=|T|+|H|-2. Bounded-degree tree Ramsey goodness conjecture. For all Δ and…
Let f=a_0+…+a_dx^d∈ C[x] be a polynomial. Is it true that, if f has roots z_1,…,z_d with corresponding arguments θ_1,…,θ_d∈ [0,2π], then for all intervals I⊆ [0,2π] lvert (# θ_i ∈ I) - lvert Irvert/2pidrvert ≪ (nlog M)^1/2, where n is the…
A tournament is a complete oriented graph, and a tournament is semiacyclic if it admits a numbering of its vertices with no directed cycle having positive winding number. A tournament is minimally not semiacyclic if it is not semiacyclic,…
k-forcing edge weighted: let w(u,v) be the weight of edge uv. let u be filled, if ∑_v unfilled neighbor of u w(u,v) ≤ k then u forces all unfilled neighbors. Minimize number of vertices needed to force the graph.
Is the weak order on S_(n) (the "inversion" poset) Sperner?
Let C_m and C_n be cycles, let C_m× C_n denote their Cartesian product, and let γ_e^*(C_m× C_n) be its porous exponential domination number. The conjecture concerns the density of such dominating sets as m and n grow. Anderson et al.'s…
Let (α,β,γ) be the type of an Ulrich partition, and call two types symmetric when they are identified by the symmetry used in the paper. Here n is a positive integer, and each k_i has the form k_i=frac4^m_i+1-13 for some m_i≥0.…
Let G be a caterpillar graph, and let M_k(G) denote its k-matching complex. Vega's conjecture. The k-matching complex M_k(G) is either contractible or homotopy equivalent to a wedge of spheres. This conjecture extends the known result for…
Find a simple closed formula for the braid-matroid Kazhdan--Lusztig polynomials.
Let T=(V,E) be a finite tree with m=|E| edges. Call a map f:Vlongrightarrow0,1,…,m a graceful labeling of T if f is injective and the induced edge labels realize every value in 1,2,…,m, i.e. |f(u)-f(v)| : uv∈ E =1,2,…,m. (Since |E|=m and…
Find useful deformations of nondegenerate curves together with easy starting matrices for Frobenius computation.
Let Y be a graph on n vertices, and let FS(Cycle_n,Y) denote its friends-and-strangers graph. The quadratic diameter conjecture asserts that the maximum diameter of a connected component of FS(Cycle_n,Y) is O(n^2). This would sharpen the…
Problem Bound the extremal number of C_10 in the hypercube.
Does there exist a value k so that in every k-arc-connected directed graph D=(V,A) and for every node v∈ V, there is a spanning in-arborescence and a disjoint spanning out-arborescence rooted in v?
Let J⊂ [n]choose k be an arrangement of largest minors, and let W∈ [n]choose k. Say that W is (≥ t,J)-largest if, for every arrangement of minors ending at J, it is absent from the final t-1 arrangements. For a maximal arrangement J of…
For each positive integer n≥ 1 there exists a positive number c(n) such that, if underlineα=(α_1,…,α_n) is a n-tuple of multiplicatively independent algebraic numbers, then h(1colon α_1colon …colon α_n)≥c(n)over ω(underlineα).
Let G be a graph, let n(G)=|V(G)| denote its order, and let ι_rm g(G) and ι_rm g'(G) denote the game isolation numbers when Dominator and Staller, respectively, start. A graph has no K_2-components if none of its connected components is…
Let A ⊆ Z_>0 be a set of positive integers such that ∑_n ∈ A 1/n = ∞ . Then for every positive integer k there exist an integer a and a non-zero integer c such that a, a+c, a+2c, …, a+kc ⊂ A, i.e. A contains arithmetic progressions of…