Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
If n ≥ 8, then each tournament of order n contains a double point.
Does there exist a graph Γ of order n and level of symmetry equal to n-k/n for arbitrarily large k ≥2 ?
Let λ be a Young diagram. Then [∅, λ] has the CDE property if and only if λ is balanced (of any slope).
For every tree T of order at least 3, overlinemc(T) ≤ 3.
For k=1,2, there exist P^(5)(k,10-k) -designs of order v if and only if: v ≥ 10-k and v ≡ 1bmod 8 or v ≡ 3bmod 8 .
Find the asymptotics of the maximizing index of E_r(n,k) .
Characterize the nontrivial lexicographic product graphs that are well-totally-dominated.
Is there a 2-factor in B_3 in which all cycles have length of at most 10?
We conjecture that this ring is Z⟨c,d,fracc^2k+1-e^2k+12⟩.
Let G be a bipartite digraph with sides A and B. For a set X ⊆ A let N^↔(X) denote the set of vertices, which have an edge to and from X. If |N^↔(X)| ≥ |X| - 1 holds for every X ⊆ A, then there exists a directed path that covers A.
For any n ≥3, the polynomial (x+1)A_n-1(x)+kx A_n-2(x) is Hurwitz stable if and only if k>-2E_n/E_n-1 .
lim_l → ∞ limsup_n → ∞ P_n^av(τ)(A_l;k_n^(n)) = 0, for all τ ∈ ∪_m=2^∞ S_m and for all k_n.
they conjectured that C_m × P_n is SEAT if m ≥ 4 even, n ≥ 3 and d ∈ 0, 2;
If G is a graph with maximum degree Δ(G) and k ≥ 2, then la_k(G) ≤ ⌈ Δ(G) · |V(G)|/2 ⌊ k|V(G)|/k+1 ⌋ ⌉, when Δ(G) = |V(G)| - 1, ⌈ Δ(G) · |V(G)| + 1/2 ⌊ k|V(G)|/k+1 ⌋ ⌉, when Δ(G) < |V(G)| - 1.
Let G be a connected simple graph of order n, and let f_o(G) denote the maximum order of an induced subgraph in which every vertex has odd degree. Berman–Wang–Wargo conjecture. For any connected simple graph G of order n, f_o(G)≥…
Let G be a graph. An edge-deck is the multiset ED(G)= G-e:e∈ E(G) . A graph is edge-reconstructible if it is uniquely determined, up to isomorphism, by its edge-deck. Harary's Edge Reconstruction Conjecture. Every graph with at least 4…
Let s,t ≥ 3 with s ≤ t and (s,t) ∉ (3,4),(3,6). A graph is doubly saturated R(s,t)-good if it is R(s,t)-good and remains so under the relevant double-saturation condition described in the paper. Existence conjecture. For every such pair…
Conjecture Let n ≥ 3 be an integer and let α(n) denote the least integer k such that there exists a simple graph on k vertices having precisely n spanning trees. Then α(n) = o(logn).
Let G(S) be the distance graph on the integers with generating set S, and let overlineα(S) denote its maximum density of an independent set. Let k≥8 with k∉9,11,16,18,25. The independence ratio conjecture. overlineα(1,k,k+7)= 4k+27/9k+72…
Let f(n) be maximal such that if B⊂ (2n,4n)∩ N there exists some C⊂ (n,2n)∩ N such that c_1+c_2 ot∈ B for all c_1 eq c_2∈ C and lvert Crvert+lvert Brvert ≥ f(n). Estimate f(n). In particular is it true that f(n)≤ n^1/2+o(1)?