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

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

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

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

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

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

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