An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

Is it true that f_DR^2(n,C)≈3/2n ? If not, can one prove at least, that f_DR^2(n,C)<(2-c)n? (34)

Given k, does every circle in an edge-minimal k-highly connected standard subspace X of |G| contain a vertex or end whose degree in X is at most k ?

For each vertex v in a graph G of order n ≥ 4, b(G-v)=b(G)+lfloorn/2⌋-2 if and only if G=C_4,P_4,2P_2

Find other possible values of the parameter d and the corresponding d-antimagic labeling of type (1, 1, 1) for the hexagonal plane map H_n^m.

Are there families of graphs such that the independence equivalence class is unbounded and each independence polynomial is irreducible?

Working in the differential tower of groups A imathS with A abelian of order r, when k ≤n the critical group K(V(U^kD^k)_n)=K(Ind_A imathS_n-k^A imathS_n1) is given, as a list of elementary divisors,…

In the general case, for any m > 1, n = 2^m, for any n-tuple of A matrices satisfying (1), does there always exist an n-tuple of B matrices of order c that satisfies construction (H0) under condition (H1), where c = M(n-1), with M defined…

For 0<α≤ 1 , among all trees, characterize the tree which has the maximum generalized distance spectral radius.

Every t-design of 2 t+k elements can be obtained from k points in t-good position using the methods developed here.

Let X,barψ be as in Lemma 6.2, and suppose that the roots of ∑_k=0^νp_kx^k are real. Then σ_ψ^2σ_X^2≥μ^4ν^-2 .

Let 3≤k≤ℓ and n≥2 ℓ . If G is an n-vertex k-chromatic ℓ -connected graph and t ≥ 3, then i_t(G)≤ i_t(G^*).

Is the Merino–Welsh conjecture true for binary matroids?

An interesting open problem is to find all the values that can be attained from paths.

We conjecture that a 3-edge-connected, nonplanar graph with representativity at least 5 has exponentially many peripheral cycles.

Open problem: • d ∈ 3, 4 for n ≥ 1

The triple (L_([2] × [2]) × [2](R^a+3), Pro, ξ(f, (x_1, x_2), a) + ξ(f, (3-x_1, 3-x_2), a)) is 4-mesic.

It seems reasonable to conjecture that for degree sequences of any order n ≥ 1 the modal multiplicity will be 1, while the median and mean multiplicities will both increase with n, the latter much more rapidly than the former.

Here is another variant that is open. In this case we begin with a -1, +1 valued matrix with discrepancy n^3/2. Say a Hadamard matrix. Balancer picks certain +1's. Unbalancer picks certain -1's. Over the course of the game, can Balancer…

Is it true for every t that ¿ lim_n →∞F(n;t)/n=1/2?

We formulate an analogue of Conjecture 1.2 for term orders with x_1 > x_2 > … > x_n (Conjecture 11.15).