Eyal Ackerman, Balázs Keszegh. The Zarankiewicz problem for polygon visibility graphs. // European Journal of Combinatorics. – 2026. – DOI: 10.1016/j.ejc.2026.104420. – URL: https://doi.org/10.1016/j.ejc.2026.104420
Eyal Ackerman & Balázs Keszegh (2026). The Zarankiewicz problem for polygon visibility graphs. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2026.104420
Eyal Ackerman and Balázs Keszegh. “The Zarankiewicz problem for polygon visibility graphs.” European Journal of Combinatorics, 2026. doi:10.1016/j.ejc.2026.104420.
@article{Ackerman2026,
title = {The Zarankiewicz problem for polygon visibility graphs},
author = {Ackerman, Eyal and Keszegh, Balázs},
journal = {European Journal of Combinatorics},
year = {2026},
doi = {10.1016/j.ejc.2026.104420},
url = {https://doi.org/10.1016/j.ejc.2026.104420}
}