Author:
Fox Jacob,Pach János,Tóth Csaba D.
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. N. Alon, J. Pach, R. Pinchasi, R. Radoičić and M. Sharir, Crossing patterns of semialgebraic sets, Journal of Combinatorial Theory. Series A 111(2) (2005), 310–326.
2. N. Alon, J. Pach and J. Solymosi, Ramsey-type theorems with forbidden subgraphs, Combinatorica 21 (2001), 155–170.
3. S. Basu, Combinatorial complexity in o-minimal geometry, in Proc. 39th Sympos. on Theory of Computing, ACM Press, New York, 2007, pp. 47–56; see also http://www.arxiv.org/abs/math.CO/0612050
4. M. Chudnovsky and S. Safra, The Erdős-Hajnal conjecture for bull-free graphs, Journal of Combinatorial Theory. Series B 98 (2008), 1301–1310.
5. R. P. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51(2) (1950), 161–166.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献