<h1>Vidnyanszky, Zoltan</h1>
<h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Darji, Udayan B. and Elekes, Márton, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220607-425364000">The structure of random automorphisms of the random graph</a>; Annals of Pure and Applied Logic; Vol. 173; No. 9; Art. No. 103152; <a href="https://doi.org/10.1016/j.apal.2022.103152">10.1016/j.apal.2022.103152</a></li>
<li>Todorčević, Stevo and Vidnyánszky, Zoltán (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210514-103015736">A complexity problem for Borel graphs</a>; Inventiones Mathematicae; Vol. 226; No. 1; 225-249; <a href="https://doi.org/10.1007/s00222-021-01047-z">10.1007/s00222-021-01047-z</a></li>
<li>Carroy, Raphaël and Miller, Benjamin D., el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210304-150950107">Minimal definable graphs of definable chromatic number at least three</a>; Forum of Mathematics, Sigma; Vol. 9; Art. No. E7; <a href="https://doi.org/10.1017/fms.2020.58">10.1017/fms.2020.58</a></li>
</ul>