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 | OA
Frankl P, Pach J, Pálvölgyi D. 2024. Odd-sunflowers. Journal of Combinatorial Theory, Series A. 206(8), 105889.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 13165 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 

1991 | Journal Article | IST-REx-ID: 4056 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.)
 

1986 | Journal Article | IST-REx-ID: 4103 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.)
 

1986 | Journal Article | IST-REx-ID: 4098 | OA
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.
View | DOI | Download None (ext.)
 

1985 | Journal Article | IST-REx-ID: 4113
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.
View | DOI
 

Filters and Search Terms

eissn=1096-0899

Search

Filter Publications