ISTA Research Explorer

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

2024 | Epub ahead of print | Journal Article | IST-REx-ID: 15247 |

Odd-sunflowers
P. Frankl, J. Pach, D. Pálvölgyi, Journal of Combinatorial Theory, Series A 206 (2024).

[Published Version] View | DOI | Download Published Version (ext.) | arXiv

2023 | Published | Journal Article | IST-REx-ID: 13165 |

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).

[Published Version] View | Files available | DOI | arXiv

2018 | Published | Journal Article | IST-REx-ID: 9587 |

Non-trivially intersecting multi-part families
M.A. Kwan, B. Sudakov, P. Vieira, Journal of Combinatorial Theory Series A 156 (2018) 44–60.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

1991 | Published | Journal Article | IST-REx-ID: 4056 |

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.

[Published Version] View | DOI | Download Published Version (ext.)

1986 | Published | Journal Article | IST-REx-ID: 4098 |

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.

View | DOI | Download None (ext.)

1986 | Published | Journal Article | IST-REx-ID: 4103 |

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.

[Published Version] View | DOI | Download Published Version (ext.)

1985 | Published | Journal Article | IST-REx-ID: 4113

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.

View | DOI