Frankl, Peter, et al. “Odd-Sunflowers.”10.1016/j.jcta.2024.105889__Journal of Combinatorial Theory, Series A, vol. 206, no. 8, 105889, Elsevier, 2024, doi:10.1016/j.jcta.2024.105889.

Fang, Lixing, et al. “Successive Vertex Orderings of Fully Regular Graphs.”10.1016/j.jcta.2023.105776__Journal of Combinatorial Theory. Series A, vol. 199, no. 10, 105776, Elsevier, 2023, doi:10.1016/j.jcta.2023.105776.

Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.”10.1016/0097-3165(91)90042-F__Journal of Combinatorial Theory Series A, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:10.1016/0097-3165(91)90042-F.

Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.”10.1016/0097-3165(86)90078-6__Journal of Combinatorial Theory Series A, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:10.1016/0097-3165(86)90078-6.

Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.”10.1016/0097-3165(86)90075-0__Journal of Combinatorial Theory Series A, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:10.1016/0097-3165(86)90075-0.

Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.”10.1016/0097-3165(85)90017-2__Journal of Combinatorial Theory Series A, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi:10.1016/0097-3165(85)90017-2.