• Publications
  • Influence
Proof of a conjecture of P
  • 226
  • 54
Ramsey-type theorems
TLDR
In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. Expand
  • 197
  • 54
  • PDF
On the maximal number of independent circuits in a graph
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 aExpand
  • 220
  • 51
Partition relations for cardinal numbers
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 wereExpand
  • 231
  • 29
  • PDF
A Problem in Graph Theory
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 aExpand
  • 136
  • 24
  • PDF
Threshold circuits of bounded depth
TLDR
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
  • 333
  • 15
  • PDF
More results on Ramsey—Turán type problems
TLDR
The paper deals with common generalizations of classical results of Ramsey and Turán. Expand
  • 61
  • 13
  • PDF
On a property of families of sets
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 hereExpand
  • 143
  • 11
  • PDF
Coloring graphs with locally few colors
TLDR
Theorem 2.4 states: The chromatic number of G , Chr( G )⩽ r 2 r log 2 log 2 m (and this value is the best possible in a certain sense). Expand
  • 61
  • 11
  • PDF