Immersione di sistemi parziali di m-cicli
Impaccando -tagli e giunti
Implementation of directed acyclic word graph
An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text is a minimal automaton that accepts all substrings of a text , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i. e. vertices,...
Implications of Spivey's Bell number formula.
Impossible Specifications for the Modular Group.
Improved bounds for and the factorical polynomial.
Improved bounds for radio -chromatic number of hypercube .
Improved bounds for the number of forests and acyclic orientations in the square lattice.
Improved bounds on the length of maximal abelian square-free words.
Improved bounds on the number of ternary square-free words.
Improved bounds on the number of ways of expressing as a binomial coefficient.
Improved expansion of random Cayley graphs.
Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes.
Improved LP lower bounds for difference triangle sets.
Improved Sufficient Conditions for Hamiltonian Properties
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity condition....
Improved upper bounds for nearly antipodal chromatic number of paths
For paths Pₙ, G. Chartrand, L. Nebeský and P. Zhang showed that for every positive integer n, where ac’(Pₙ) denotes the nearly antipodal chromatic number of Pₙ. In this paper we show that if n is even positive integer and n ≥ 10, and if n is odd positive integer and n ≥ 13. For all even positive integers n ≥ 10 and all odd positive integers n ≥ 13, these results improve the upper bounds for nearly antipodal chromatic number of Pₙ.
Improved upper bounds for self-avoiding walks in .
Improved upper bounds for the Laplacian spectral radius of a graph.
Improvement of inequalities for the -structures and some geometrical connections
The main results are the inequalities (1) and (6) for the minimal number of -structure classes,which improve the ones from [3], and also some geometrical connections, especially the inequality (13).
Improvements on Chomp.