On Size Ramsey Number of Paths, Trees and Circuits. II

1990/01/01 by József Beck · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics #Discrete mathematics #Graph #Limits and Structures in Graph Theory #Mathematics #Monochromatic color #Physics #Ramsey's theorem #Random graph #Simple (philosophy)

paper · doi:10.1007/978-3-642-72905-8_4

crossref issued 1990/01/01 · crossref published 1990/01/01 · crossref published-print 1990/01/01 · openalex publication_date 1990/01/01 · crossref created 2012/02/24 · crossref deposited 2020/11/24 · openalex created_date 2025/10/10 · crossref indexed 2026/03/10 · openalex updated_date 2026/08/04

Citations

• Hamiltonian circuits in random graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• On the combinatorial problems which I would most like to see solved

Cited by

• Diameters and eigenvalues
• Path Ramsey Number for Random Graphs
• Ramsey's theorem [wikipedia]