Problems

If G is a critical graph (not banned) and ρ^⊥(G)=d , then G-M(G) (with M a match maximal) has ρ^⊥(G-M(G))≤ d-1

Can one prove better upper or lower bounds for ℓ_n ?

Conjecture 1. Given an undirected connected graph G. We consider v an extremum of the Fiedler vector of the graph G.\tilde{G} is the graph obtained from G and v as in Proposition 1. Then for all x>0 the Fiedler vector \Phi(x,\cdot) of…

The question of finding necessary and sufficient conditions for this to happen is to the best of the author's knowledge an open problem.

While it is important to note that twisted subgroups need not be subgroups (e.g., there are small counterexamples in non-abelian groups of order 27 and 75), it could perhaps be the case that L(G) = {|H| : H \subsetneq G} (and thus, our…

Under which conditions a)d(G_1,G_2)=q_1+q_2+|p_1-p_2|-2,b)d(G_1,G_2)=q_1+q_2+|p_1-p_2|-4 hold?

If F = F_q is a finite field of odd size or F = F_∞ is an algebraically closed field of characteristic zero, then every graph Γ_F(f_2, f_3) of girth at least eight is isomorphic to Γ_3(F) = Γ_F(xy, x^2y).

There exists a chain complex of finitely generated FI-modules C_* such that H_k(C_*) = H_k(K_p(S_•)).

The characteristic set of a path-star tree contains an edge.

Can we prove that they are actually convergent to the same limit?

The maximum possible load, on any vertex in any graph, is 1/8n^3-O(n^2) .

Given a finite CW complex X which is not contractible and two ρ-immersed matroids (M, l) and (N, l') such that T_X(M, l) ≃ T_X(N, l'), if there exists a surjective weak map τ: M → N, then τ^# is an isomorphism.

But we conjecture that at least one of π and π^{-1} will always have a sufficiently large strong compatible set to ensure a better approximation for bs(π)=bs(π^{-1}) .

A minimal forbidden induced subgraph for the property c_2(G)≤ k has at most 2 k+2 vertices.

We conjecture that this is true for all q.

• ρ^⊥(G) + ρ^⊥(barG) ≥ |V(G)| - 2 • ρ^⊥(G) + ρ^⊥(barG) ≤ |V(G)| + 2

In which condition power graph P(G) of a non-degenerate gyrogroup G is complete?

For any triple of positive integers a = (a_1, a_2, a_3) the sequence of numbers the sequence g_i(a)_i=0^∞ is monotonically increasing with i, for i ≤ 14.

Identify and characterise the product graphs whose curling numbers are the product of the curling numbers of their factors graphs.

It is possible to adapt Theorem 1 to arbitrary posets (instead of 0, 1-posets) and to injective maps φ with x < y ⇔ φ(x) < φ(y) (instead of x ≤ y ⇔ φ(x) ≤ φ(y))?