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

Successive vertex orderings of fully regular graphs
L. Fang, H. Huang, J. Pach, G. Tardos, J. Zuo, Journal of Combinatorial Theory. Series A 199 (2023).
LibreCat: https://research-explorer.ista.ac.at/record/13165
DOI: 10.1016/j.jcta.2023.105776
arXiv: 2206.13592

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

A lower bound on the number of unit distances between the vertices of a convex polygon
H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.
LibreCat: https://research-explorer.ista.ac.at/record/4056
DOI: 10.1016/0097-3165(91)90042-F

On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.
LibreCat: https://research-explorer.ista.ac.at/record/4103
DOI: 10.1016/0097-3165(86)90078-6

The number of extreme pairs of finite point-sets in Euclidean spaces
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.
LibreCat: https://research-explorer.ista.ac.at/record/4098
DOI: 10.1016/0097-3165(86)90075-0

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