In a recent paper [l] K . CORRADI and A. HAJNAL proved that if a finite graph without multiple edges contains at least 3k vertices and the valency of every vertex is at least 2k, where k is a… Expand

1. INTRODUCTION In this paper our main object is the study of relations between cardinal numbers which are written in the form a-(b o , b,,. . .) r or a-(b)C ~° or (b) (b o b,) Such relations were… Expand

A gruph consists of a finite set of vertices some pairs of which are adjacent, i.e., joined by an edge. No edge joins a vertex to itself and at most one edge joins any two vertices. The degree of a… Expand

We examine a powerful model of parallel computation: polynomial size threshold circuits of bounded depth (the gates compute threshold functions with po-omial weights).Expand

1. Introduction. In this paper we are going to generalize a problem solved by MILLER in his paper [l] and prove several results concerning this new problem and some related questions. We mention here… Expand