Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16...
In this work we propose a conjecture about the stability of the periodic solutions of the Ricker equation with periodic parameters, which goes beyond the existing theory, and for ...
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
For the families ax4 = by4 +z4 +v4 +w4 , a, b = 1, . . . , 100, and ax3 = by3 + z3 + v3 + w3 , a, b = 1, . . . , 100, of projective algebraic threefolds, we test numerically the co...
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...