On finite homomorphic images of the multiplicative group of a division algebra.
We deal with the problems of four boundary points conditions for both differential inclusions and differential equations with and without moving constraints. Using a very recent result we prove existence of generalized solutions for some differential inclusions and some differential equations with moving constraints. The results obtained improve the recent results obtained by Papageorgiou and Ibrahim-Gomaa. Also by means of a rather different approach based on an existence theorem due to O. N. Ricceri...
If G is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings (a Fulkerson covering) with the property that every edge of G is contained in exactly two of them. A consequence of the Fulkerson conjecture would be that every bridgeless cubic graph has 3 perfect matchings with empty intersection (this problem is known as the Fan Raspaud Conjecture). A FR-triple is a set of 3 such perfect matchings. We show here how to derive a Fulkerson covering from two FR-triples. Moreover,...
We estimate the number of possible degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.
Let be a simple graph, let denote the degree of a vertex and let be a nonnegative integer function on with for each vertex . A -coloring of is an edge coloring such that for each vertex and each color , there are at least edges colored incident with . The -chromatic index of , denoted by , is the maximum number of colors such that a -coloring of exists. Any simple graph has the -chromatic index equal to or , where . A graph is nearly bipartite, if is not...
Vizing [15] and Erdős et al. [8] independently introduce the idea of considering list-colouring and k-choosability. In the both papers the choosability version of Brooks' theorem [4] was proved but the choosability version of Gallai's theorem [9] was proved independently by Thomassen [14] and by Kostochka et al. [11]. In [3] some extensions of these two basic theorems to (𝓟,k)-choosability have been proved. In this paper we prove some extensions of the well-known bounds for...
In 1968 Erdős and Hajnal introduced shift graphs as graphs whose vertices are the k-element subsets of [n] = 1,...,n (or of an infinite cardinal κ ) and with two k-sets and joined if . They determined the chromatic number of these graphs. In this paper we extend this definition and study the chromatic number of graphs defined similarly for other types of mutual position with respect to the underlying ordering. As a consequence of our result, we show the existence of a graph with interesting...