• Publications
  • Influence

Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from public sources and our publisher partners.
  • Paul Erdös
  • Mathematics
  • 1947 (First Publication: 1 April 1947)
  • The present note consists of some remarks on graphs. A graph G is a set of points some of which are connected by edges. We assume here that no two points are connected by more than one edge. TheExpand
  • Paul Erdös
  • Mathematics
  • 1959
  • A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a completeExpand
  • Vasek Chvátal, Paul Erdös
  • Computer Science, Mathematics
  • Discret. Math.
  • 1972 (First Publication: 1 May 1972)
  • Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no Hamiltonian circuit, there is a vertex x with x ~ C . Since G is s-connected,Expand
  • Paul Erdös, M. SIMOINOVITS
  • 1966
  • In this paper G(n ; I) will denote a graph of n vertices and l edges, K„ will denote the complete graph of p vertices G (p ; (PA and K,(p i , . . ., p,) will denote the rchromatic graph with p iExpand
  • Paul Erdös, András Hajnal
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • 1989 (First Publication: 1 September 1989)
  • Abstract In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic)Expand