|
[301] Beyond the Magic Mountain (A Varázshegyen túl, in Hungarian), Érintő (Elektronikus Mat. Lapok), September 2016 and Élet \és Irodalom, August 12, 2016.
[302] On the size of k-cross-free families (with A. Kupavskii and I. Tomon), Combinatorica 39(1) (2019): 153-164. [303] Controlling Lipschitz functions (with A. Kupavskii and G. Tardos), Mathematika 64 (2018), 898-910. [304] Disjointness graphs of segments (with G. Tardos and G. Tóth), in: Proc. 33rd Annual Symposium on Computational Geometry (SoCG 2017), 59:1-15. Combin. Probab. Computing 30 (2021), no. 4, 498-512. [305] Erdős-Hajnal conjecture for graphs with bounded VC-dimension (with J. Fox and A. Suk), in: Proc. 33rd Annual Symposium on Computational Geometry (SoCG 2017), 43:1-15. Also in: Discret. Comput. Geom. 61(4) (2019), 809-829. [306] Many touchings force many crossings (with G. Tóth), in: 25th Internat. Symposium on Graph Drawing (GD2017). Lecture Notes in Computer Science 10692, Springer, 2018, 153-169. Also in: J. Comb. Theory, Ser. B 137 (2019), 104-111. [307] Thrackles: An improved upper bound (with R. Fulek), in: 25th Internat. Symposium on Graph Drawing (GD2017). Lecture Notes in Computer Science 10692, Springer, 2018, 153-169. Also in: Discret. Appl. Math. 259 (2019), 226-231. [308] Two extensions of the Erdős-Szekeres problem (with A. Holmsen, H. Nassajian Mojarrad, G. Tardos), J. European Math. Soc. 22 (2020), no. 12, 3981-3995. [309] Tilings with noncongruent triangles (with A. Kupavskii and G. Tardos), European J. Combin. 73 (2018), 72-80.
[310] Tilings of the plane with unit area triangles of bounded diameter (with A. Kupavskii and G. Tardos), Acta Math. Hung. 155 (2018), no. 1, 175-183. [311] A crossing lemma for multigraphs (with G. Tóth), in: Proc. 34th Annual Symposium on Computational Geometry (SoCG 2018), 65:1-13, 2018. Also in: Discret. Comput. Geom. 63(4) (2020): 918-933. [312] Almost all string graphs are intersection graphs of plane convex sets (with B. Reed, Y. Yuditsky), in: Proc. 34th Annual Symposium on Computational Geometry (SoCG 2018), 68:1-14, 2018. Also in: Discret. Comput. Geom. 63(4) (2020): 888-917. [313] A note on the clique chromatic number of geometric graphs (with J. Fox, A. Suk), Geombinatorics XXVIII (2018), Issue 2, 83-92. [314] Tiling the plane with equilateral triangles (with G. Tardos), Geombinatorics, Geombinatorics XXVIII (2019), no. 4, 197-205. [315] Ramsey-Turán numbers for semi-algebraic graphs (with J. Fox and A. Suk), Electron. J. Comb. 25(4): P4.61 (2018). [316] A stability theorem for cube tessellations (with P. Frankl), Computational Geometry 9 (2018), no. 1, 387-390. [317] Planar point sets determine many pairwise crossing segments (with N. Rubin and G. Tardos), STOC 2019: 1158-1166. Also in: Advances in Mathematics 386 (2021), 107779. (On-line) [318] On the chromatic number of disjointness graphs of curves (with I. Tomon), Proc. 35th Annual Symposium on Computational Geometry (SoCG 2019), 54:1-17, LIPIcs, 2019. Also in: J. Combinatorial Theory B, 144 (2020): 167-190. [319] The number of crossings in multigraphs with no empty lens (with M. Kaufmann, G. Toth, and T. Ueckerdt), in: Graph Drawing and Network Visualization, Lecture Notes in Comput. Sci. 11282, Springer, Cham, 2018, 242-254. Also in: J. Graph Algorithms and Applications 25 (2021), 383-396. [320] Ordered graphs and large bi-cliques in intersection graphs of curves (with I. Tomon), European J. Combinatorics 82 (2019), 102994 (on-line). (Extended abstract in: Acta Math. Univ. Comenian. (N.S.) 88 (2019), no. 3, 985-988.) [321] Large homogeneous submatrices (with D. Korándi and I. Tomon), SIAM J. Discrete Mathematics 34(4) (2020): 2532-2552. [322] Green-Wins Solitaire revisited--Simultaneous flips that affect many edges (with M. Hoffmann and M. Stojaković), in: 35th European Workshop on Computational Geometry 2019, 9:1-6. [323] Small triangular containers for triangles--On a problem of Nandakumar (with G. Kiss), Mathematics Newsletter-Ramanujan Mathematical Society 30 (2019), no. 3, 69-71. [324] Coloring Hasse diagrams and disjointness graphs of curves (with I. Tomon), in: Graph Drawing and Network Visualization '19, Lecture Notes in Comput. Sci. 11904, Springer-Verlag, Cham, 2019, 244-250. [325] Colorings with only rainbow arithmetic progressions (with I. Tomon), Acta Mathematica Hungarica 161 (2020): 507-515. |
|