We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given ...

© 2018 Wiley Periodicals Inc. We show that for every η > 0 there exists an integer n 0 such that every 2-coloring of the 3-uniform complete hypergraph on n ≥ n 0 vertices contains two disjoint monochromatic tight cycles ...

In the paper the method of reduction of the memory size in the microprogrammed controllers with sharing codes is discussed. The idea is based on the modification of internal modules and connections of the device. Next, the ...

In the paper the method of reduction of the memory size in the microprogrammed controllers with sharing codes is discussed. The idea is based on the modification of internal modules and connections of the device. Next, the ...

"The organization of the thesis is as follows. Chapter 1 contains a review of basic concepts on graph theory and boolean expressions. Important de nitions are stated and some relevant examples are presented. Next, in ...

We establish a generalized Perron-Frobenius theorem, based on a combinatorial criterion which entails the existence of an eigenvector for any nonlinear order-preserving and positively homogeneous map f acting on the open ...

We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a set of colours (instead of just one colour). We give bounds for ...

This is the first of two volumes of a state-of-the-art survey article collection which originates from three commutative algebra sessions at the 2009 Fall Southeastern American Mathematical Society Meeting at Florida ...