P. Frankl, J. Pach, and D. Pálvölgyi, “Odd-sunflowers,” Journal of Combinatorial Theory, Series A, vol. 206, no. 8. Elsevier, 2024.
LibreCat: https://research-explorer.ista.ac.at/record/15247
DOI: 10.1016/j.jcta.2024.105889
arXiv: 2310.16701

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.
LibreCat: https://research-explorer.ista.ac.at/record/13165
DOI: 10.1016/j.jcta.2023.105776
arXiv: 2206.13592

M. A. Kwan, B. Sudakov, and P. Vieira, “Non-trivially intersecting multi-part families,” Journal of Combinatorial Theory Series A, vol. 156. Elsevier, pp. 44–60, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/9587
DOI: 10.1016/j.jcta.2017.12.001
arXiv: 1703.09946

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.
LibreCat: https://research-explorer.ista.ac.at/record/4056
DOI: 10.1016/0097-3165(91)90042-F

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.
LibreCat: https://research-explorer.ista.ac.at/record/4103
DOI: 10.1016/0097-3165(86)90078-6

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.
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite set in the plane,” Journal of Combinatorial Theory Series A, vol. 38, no. 1. Elsevier, pp. 15–29, 1985.
LibreCat: https://research-explorer.ista.ac.at/record/4113
DOI: 10.1016/0097-3165(85)90017-2