Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For every constant C>0, is there a constant c>0 such that every n-vertex graph with no clique or independent set of size Clog_2 n has at least cn^5/2 induced subgraphs with pairwise distinct ordered pairs (number of vertices, number of…
Conjecture 6. 3 (Shen) For a digraph G on n vertices of girth g, define t(G, r ) = ∑ u:δ+ G(u)<r (r − δ+ G (u)). If δ+ G ≥ 1, then n ≥ r(g − 1) + 1 − t(G, r ).
conjecture. Salvatore Stuvard presented the state-of-the-art on the fine properties of singular sets of area minimizing currents mod p, both for the hypersurface case and general codi- mensional case. Zihui Zhao presented the estimate on…
Fix integers m≥4 and n≥ m. Consider the m-1 coordinate hyperplanes in R^m-1 and add n further hyperplanes. Bounded-region realization conjecture. For every integer k satisfying 1≤ k≤binomn+m-2m-1, there exist n hyperplanes such that the…
Every Latin square of order n has a partial transversal of size n-1 and, when n is odd, a transversal; equivalently, every proper n-coloring of K_{n,n} has a rainbow matching of size n-1.
Let u and w be two subrows of the Kolakoski sequence, and let P_n(u) denote the parity-history integral associated with u at index n. Parity-history uniqueness conjecture. If P_n(u)=P_n(w) for every n≥ 0, then u=w. This is presented as a…
Let K_n be the complete graph on n vertices. In a (q:1) Waiter–Client game on E(K_n), Waiter offers q+1 unclaimed edges in each round, and Client claims one offered edge while Waiter claims the others. Acyclic Client graph conjecture. For…
Let G=(V,E) be a d-regular graph, meaning that every vertex has exactly d neighbors. Assume that G satisfies the discrete Bakry–Émery curvature-dimension condition CD(0,∞). Regular-graph self-improvement conjecture. Any d-regular graph…
Packing/Covering conjecture for infinite matroids: for any two matroids M and N on a common ground set E, does there exist a partition E=P\mathbin{\dot\cup}C such that M|P and N|P have disjoint spanning sets, while M.C and N.C have…
What is the length of the shortest sequence in [n]* containing, as a (consecutive) subword, each permutation of [n]? See this, this, this, this, and this.
Let c≥ 1 be an odd integer, and let (P,Q) be a compatible-inclusion problem, with its c-weakening defined by retaining directed edges represented by paths of length at most c. The compatible-inclusion weakening conjecture. There is an odd…
The report poses three open questions in online graph-coloring games: can the vertex/edge-coloring threshold theorem be generalized from two colors to any r≥2 colors; does the lower-bound formula based on the parameter m₁(F) give the…
Let tt K_n be the complete digraph on n vertices, with a bidirectional edge between every pair of vertices. Let tt G be any digraph on n vertices, and write X(-) for the multipath complex and widetildeχ for reduced Euler characteristic.…
A distance-regular graph is a connected regular graph whose distance partition around every vertex has the same intersection numbers; connected strongly regular graphs are exactly the distance-regular graphs of diameter 2. Pyber's…
Let G be a critical snark, let a hexagon be a 6-cycle, and let a hexagon be double-core when it is a double-core hexagon for a 3-array of perfect matchings. An optimal 3-array is a 3-array leaving the minimum possible number of uncovered…
Let J^*_n(f(x)) be a Jaco graph, where f(x)=mx+c, with x∈N, m≥ 2, and c≥ 1. Write π(J^*_n(f(x))) for its Thue chromatic index, and let Δ(J^*_n(f(x))) and δ(J^*_n(f(x))) denote its maximum and minimum degrees, respectively. Generalised Jaco…
Let G(S) be a graph on a surface S admitting a mapping-class-group action, and call essential subsurfaces on which the subsurface projection is everywhere defined holes. If every pair of holes intersects, must G(S) be Gromov hyperbolic?…
Let G be a graph. A set S⊆ V(G) is a terminal set if S is a general position set of G and adding any vertex u∈ V(G)-S to S creates three-in-a-line with u as an endpoint. Kruft's conjecture. Every graph has a terminal set. Terminal sets…
Give another proof of the paper's identities (Ж) and (ж) using the methods for identity (1). Can f(a,b,c,d) be interpreted as a residue at (a+b)+(c+d)i, or otherwise related to the Gaussian integers?
A balanced pairing is a pairing of the marked points under consideration satisfying the balancedness condition defined above; two balanced pairings are connected if they are related by the allowed cut-and-glue operations and equivalences…