Author:
Kojman Menachem,Shelah Saharon
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Theories of Computational Complexity;Calude,1988
2. On Gödel incompleteness and finite combinatorics;Kanamori;Ann. Pure Appl. Logic,1987
3. On canonical Ramsey numbers for complete graphs versus paths;Leffman;J. Combin. Theory Ser. B,1993
4. Ramsey–Paris–Harrington numbers for graphs;Mills;J. Combin. Theory Ser. A,1985
5. Shelah's proof of the Hales-Jewett theorem;Nilli,1990
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献