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 | 
Frankl, Peter, János Pach, and Dömötör Pálvölgyi. “Odd-Sunflowers.” Journal of Combinatorial Theory, Series A. Elsevier, 2024. https://doi.org/10.1016/j.jcta.2024.105889.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 13165 |
Fang, Lixing, Hao Huang, János Pach, Gábor Tardos, and Junchi Zuo. “Successive Vertex Orderings of Fully Regular Graphs.” Journal of Combinatorial Theory. Series A. Elsevier, 2023. https://doi.org/10.1016/j.jcta.2023.105776.
[Published Version]
View
| Files available
| DOI
| arXiv
1991 | Journal Article | IST-REx-ID: 4056 |
Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial Theory Series A. Elsevier, 1991. https://doi.org/10.1016/0097-3165(91)90042-F.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4103 |
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90078-6.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90075-0.
View
| DOI
| Download None (ext.)
1985 | Journal Article | IST-REx-ID: 4113
Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” Journal of Combinatorial Theory Series A. Elsevier, 1985. https://doi.org/10.1016/0097-3165(85)90017-2.
View
| DOI