Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6 Publications
2024 | Journal Article | IST-REx-ID: 15247 | 
P. Frankl, J. Pach, and D. Pálvölgyi, “Odd-sunflowers,” Journal of Combinatorial Theory, Series A, vol. 206, no. 8. Elsevier, 2024.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 13165 |
L. Fang, H. Huang, J. Pach, G. Tardos, and J. Zuo, “Successive vertex orderings of fully regular graphs,” Journal of Combinatorial Theory. Series A, vol. 199, no. 10. Elsevier, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
1991 | Journal Article | IST-REx-ID: 4056 |
H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances between the vertices of a convex polygon,” Journal of Combinatorial Theory Series A, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4103 |
H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4098 |
H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” Journal of Combinatorial Theory Series A, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.
View
| DOI
| Download None (ext.)