Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
- Pham presented the proof of a related conjecture of Talagrand, which also follows from their method.
Pham presented the proof of a related conjecture of Talagrand, which also follows from their method. Patrick Morris presented his recent proof of a beautiful conjecture of Krivele- vich, Sudakov and Szabó, on the threshold for the…
Conjecture 6. 3 5. (Thomass´ e) In a digraph D, ∑ v∈V(D) |δ+ D (v) − δ− D (v)| + |{ (u, v )|d(u, v ) ≤ 2}| ≥ 2|E(D)| + |{ v|δ+ D (v) > δ − D (v)}|. Note: This is exact for transitive tournaments.
Habiro cohomology & THH(−/ku) Ferdinand Wagner Habiro cohomology is supposed to be a (positive) answer to the following question of Peter Scholze: Question. Is there a version of q-de Rham cohomology with coefficients not in the power series…
For a loopless matroid M=(S,r), let Δ(M)=max_X⊆ S |X|/r(X). Let M_1=(S,r_1) and M_2=(S,r_2) be two arbitrary loopless matroids on S. Is it true that S can be partitioned into ⌈maxΔ(M_1),Δ(M_2)⌉+1 common independent sets?
Let S_m,n be the graph family considered in the paper, and let a chromatic root mean a zero of its chromatic polynomial in the complex q-plane. There exists a finite constant Q such that |q|>Q is filled densely by chromatic roots of S_m,n…
Let T be a tree with ℓ leaves, let T denote the family of trees used in the discrepancy definition, and let D^1(T,T) denote the one-dimensional, or complex, discrepancy. Write Δ(T) for the maximum degree of T. Complex discrepancy…
For every integer h≥ 2 and every integer n≥ 2h-2, does there exist a collection of h permutations π_1,…,π_h of 1,…,n such that all proper partial sums ∑_i=1^kπ_j(i), with 1≤ j≤ h and 1≤ k≤ n-1, are pairwise distinct? Equivalently, whenever…
Despite this inherent instability of the critical solution, we expect extremal critical collapse itself to be a stable phenomenon: We conjecture that there exists a teleologically determined “hypersurface” in moduli space which con- sists…
A path factor of a graph is a factor whose components are paths on at least two vertices. Let P_m be the path on m vertices, and let Δ(G) denote the maximum degree of a graph G. Kao's conjecture. For every integer k≥ 3, there exists a…
Let ζ_p:Z_p→Q_p be the p-adic zeta function. Is ζ_p(k)≠0 for every even integer k?
Let m>1, and let C_n^(m) denote the generalized Catalan numbers considered in the paper. Define K_m= e^3/2 if m=2, 2binom22binom42dotsbbinomm-12/m^(2m-3)/2 if m≥ 3 and is odd, √2binom32binom52dotsbbinomm-12/m^(2m-3)/2 if m≥ 4 and is even.…
Let G be a connected cubic graph of order n. The 7/18 bound conjecture. γ(G) ≤ 7/18n + 2/3. The source gives 7/18 ≤ ρ_0 ≤ 5/12 for the asymptotic infimum of γ(G)/n over connected cubic graphs and suspects that ρ_0=7/18.
Let f(G) denote the maximum chromatic number of an acyclic subgraph of an oriented graph G. Let g(n) be the smallest integer such that every tournament G with more than g(n) vertices has f(G)>n. Subquadratic growth conjecture. g(n)=o(n^2).…
Let G be a 3-edge-connected graph, meaning that deleting fewer than three edges does not disconnect it, and let its maximum degree be Δ. A rich k-flow is a nowhere-zero k-flow whose absolute values differ on every pair of adjacent edges.…
Solymosi : Suppose a family V of n points are chosen in R^(3) and L is a collection of lines so that every triangle spanned by three points of V is pierced by some element of L. Show that |L| must grow at least linearly in n. (Best known:…
Let C_11 denote the cycle on eleven vertices. A Šoltés graph is a graph for which deleting any vertex leaves the Wiener index unchanged. Šoltés graph uniqueness conjecture. The cycle on eleven vertices, C_11, is the only Šoltés graph. The…
Let D=(V,A) be a digraph with arc-capacities c : A → N and a root node r_0∈ V. A k-arborescence is the arc-disjoint union of k spanning arborescences rooted at r_0. Is it true that if c(a)≤ l for every a ∈ A and there is a capacity-obeying…
For every \varepsilon>0, does there exist n_0=n_0(\varepsilon) such that every graph on n\geq n_0 vertices that is the edge-disjoint union of at least \varepsilon n^{3/2} quadrilaterals contains another quadrilateral? Moreover, is it true…
Conjecture Every 2-connected graph may be embedded in a surface so that the boundary of each face is a cycle.
Let T be a tree. For a vertex subset W⊆ V(T), write e(W)=|E(T[W])| and let d(W) be the number of edges of T with exactly one endpoint in W. The generalized degree sequence of T is the multiset (|W|,e(W),d(W)): W⊆ V(T). Crew's conjecture.…