Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For n∈N, let Π(n) be the product of its decimal digits, and let Pm(n) be the least positive integer such that Π^Pm(n)(n)=Π^Pm(n)+1(n). Is Pm(n)≤11 for every n?
Is it true that if A⊂ R^2 is a set of n points such that every subset of 3 points determines 3 distinct distances (i.e. A has no isosceles triangles) then A must determine at least f(n)n distinct distances, for some f(n)→ ∞?
Let K_v denote the complete graph on 0,1,…,v-1, and let ℓ(H) be the multiset of edge-lengths of a graph H, with edge lengths in K_v defined by ℓ(x,y)=min(|x-y|,v-|x-y|). Horak–Rosa conjecture. Let L be a list of v-1 positive integers not…
Let A=A(S) be a normalized skew-symmetrizable cluster algebra, where S is a mutation equivalence class of seeds, and let a cluster mean the set of cluster variables in a seed. Two seeds belong to the same mutation equivalence class as…
Let n,k,r,t be positive integers with n≥kr+(t-1)(k-1). If the r-element subsets of an n-element set are coloured with t colours, must some colour contain k pairwise disjoint sets?
For a loopless graph G, let λ_G(x,y) be the maximum number of edge-disjoint paths between distinct vertices x and y, and let the maxmaxflow be Λ(G)=max_x≠ yλ_G(x,y). A chromatic root is a zero of the chromatic polynomial. Jackson–Sokal's…
A graph G contains a graph H if H is isomorphic to an induced subgraph of G, and G is H-free otherwise. Erdős and Hajnal [6, 7] proposed in 1977 the following well-known conjecture, stating that unlike in arbitrary graphs where we can…
Let G be a bipartite graph, and call a vertex pendant when it has degree one. Frankl's pendant-vertex conjecture. Every bipartite graph with at least one pendant vertex satisfies Frankl's conjecture. The source places this among…
Let overlineP^⋆ be the family of 3-connected maximal 1-planar graphs, and let m(overlineP^⋆,n) denote the minimum number of edges among graphs in this family with n vertices. Hudák–Madaras–Suzuki conjecture. m(overlineP^⋆,n)=18/5n+c, where…
For each integer n≥ 1 there exists a positive constant c(n) such that, for any algebraic subvariety V of G_m^n which is defined over Q, which is Q-irreducible, and which is not a union of translates of algebraic subgroups by torsion…
Question Does there exist a constant c>1/2 and a function n_0(k) such that if |X|≥ n_0(k), then every saturated k-Sperner system F⊆ P(X) has cardinality at least 2^(1+o(1))ck?
For a graph G, we define Δ(G) to be the maximum degree, ω(G) to be the size of the largest clique subgraph, and χ(G) to be the chromatic number of G. Conjecture χ(G) ≤ ceil1/2(Δ(G)+1) + 1/2ω(G) for every graph G.
Let G be an oligomorphic permutation group on a set G, and let G be a countable smooth digraph of algebraic length 1 on G that is invariant under G. A pseudoloop is an edge obtained from a loop by applying elements of G to its endpoints.…
Let G=(V,E) be a graph and let k be a positive integer. A k-vertex-connected orientation is an orientation of G that is k-vertex-connected. Frank's conjecture. G has a k-vertex-connected orientation if and only if |V|≥ k+1 and G-X is…
Let M=(M_n,k)_n,k≥ 0 be the array associated with the row numerators of the generating functions of T(n,m). For a fixed column k, write its generating function as ∑_n≥ 0M_n,kx^n, and let N_4(x) be the polynomial displayed below.…
Starting with K_n, repeatedly choose a triangle uniformly at random and delete its three edges until the graph is triangle-free. If f(n) is the number of remaining edges, is f(n)=n^3/2+o(1) with high probability, and in particular is…
Let Σ be a surface of genus g, let G_Σ denote the class of graphs embeddable in Σ, and let N(Δ,k,G_Σ) be the maximum order of a graph in G_Σ with maximum degree at most Δ and no cycle of length at most k. There exist a constant c and a…
Let G be a 1-dof graph, meaning a graph whose generic configuration fiber has one degree of freedom, and let its generic fiber have genus one. A graph is said to be equivalent to a four-cycle when it has exactly four maximal rigid…
Determine the least positive integer n_1 and the greatest negative integer n_2 for which a D(n_i)-quintuple exists.
Explicitly construct global algebras or Brauer classes with prescribed local data, especially when the local splitting fields are dihedral.