Publisher
Springer Science and Business Media LLC
Reference6 articles.
1. P. Erdős andR. Radó, A partition calculus in set theory,Bull. Amer. Math. Soc. 62 (1956), 427–489.
2. P. Erdős, A. Hajnal andR. Radó, Partition relations for cardinal numbers,Acta Math. Acad. Sci. Hungar. 16 (1965), 93–196.
3. P. Erdős andG. Szekeres, A combinatorial problem in geometry,Compositio Math. 2 (1935), 463–470.
4. P. Erdős, Some remarks on the theory of graphs,Bull. Amer. Math. Soc. 53 (1947), 292–294.
5. P. Erdős andA. Rényi, On the evolution of random graphs,Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 17–61.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Set-Coloring Ramsey Numbers via Codes;Studia Scientiarum Mathematicarum Hungarica;2024-04-15
2. Ramsey numbers upon vertex deletion;Journal of Graph Theory;2024-03-18
3. Formalizing Finite Ramsey Theory in Lean 4;Lecture Notes in Computer Science;2024
4. A lower bound for set‐coloring Ramsey numbers;Random Structures & Algorithms;2023-08-03
5. Hypergraph Ramsey numbers of cliques versus stars;Random Structures & Algorithms;2023-05-18