Some remarks on the theory of graphs

1947/01/01 by P. Erdös · 10 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Graph theory and applications #Mathematical economics #Mathematics

paper · pdf · doi:10.1090/s0002-9904-1947-08785-1

openalex publication_date 1947/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/22

Abstract

Recently very much more general theorems have been proved by Grnwald and Milgram. 3 They in fact proved (among others) that the condition that G' contains no closed directed path is superfluous.

Cited by

• Ramsey's theorem—A new lower bound
• Density theorems for bipartite graphs and related Ramsey-type results
• Ramsey-type problem for an almost monochromatic K₄
• On the conjecture of hajós
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Asymptotic lower bounds for Ramsey functions
• Intersection theorems with geometric consequences
• Bounded monochromatic components for random graphs
• On two problems in graph Ramsey theory
• Ramsey's theorem [wikipedia]