István Tomon - List of Publications

Submitted papers

Z. Jin, A. Milojević, I. Tomon, S. Zhang. From small eigenvalues to large cuts, and Chowla's cosine problem (2025)
https://arxiv.org/pdf/2509.03490

Z. Hunter, A. Milojević, B. Sudakov, I. Tomon. C_4-free subgraphs of high degree with geometric applications (2025)
https://arxiv.org/pdf/2506.23942

Z. Hunter, A. Milojević, B. Sudakov, I. Tomon. Long induced paths in K_{s,s}-free graphs (2024)
https://arxiv.org/pdf/2411.19173

Z. Hunter, A. Milojević, B. Sudakov, I. Tomon. Disjoint pairs in set systems and combinatorics of low rank matrices (2024)
https://arxiv.org/pdf/2411.13510

A. Milojević, B. Sudakov, I. Tomon. Incidence bounds via extremal graph theory (2024)
https://arxiv.org/pdf/2401.06670.pdf

A. Bishnoi, I. Tomon. Explicit constructions of optimal blocking sets and minimal codes, to appear in Combinatorica
https://arxiv.org/pdf/2411.10179

I. Balla, L. Hambardzumyan, I. Tomon. Factorization norms and an inverse theorem for MaxCut, to appear in Mathematische Annalen
https://arxiv.org/pdf/2506.23989

E. Räty, B. Sudakov, I. Tomon. Positive discrepancy, MaxCut, and eigenvalues of graphs, to appear in Trans. AMS
https://arxiv.org/pdf/2311.02070.pdf

Journal publications

2026

V. Falgas-Ravry, E. Räty, I. Tomon. Dedekind's problem in the hypergrid. Adv. Math. 488 (2026): 110796.
https://doi.org/10.1016/j.aim.2026.110796

E. Räty, I. Tomon. Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs. Journal of Combinatorial Theory, Series B 177 (2026): 186-215.
https://doi.org/10.1016/j.jctb.2025.11.003

J. Nagy, P. P. Pach, I. Tomon. Hyperplane covers of finite spaces and applications. Trans. AMS 379 (1) (2026): 137-156.
https://doi.org/10.1090/tran/9483

2025

N. Frankl, A. Jung, I. Tomon. The Quantitative Fractional Helly theorem. Isr. J. Math. (2025)
https://doi.org/10.1007/s11856-025-2862-7

B. Sudakov, I. Tomon. Matrix discrepancy and the log-rank conjecture. Mathematical Programming 212 (2025): 567-579.
https://doi.org/10.1007/s10107-024-02117-9

E. Räty, I. Tomon. Large Cuts in Hypergraphs via Energy. Math. Proc. Camb. Soc. 179 (1) (2025): 45-61.
https://doi.org/10.1017/S0305004125000362

I. Tomon. The number of symmetric chain decompositions. Proc. Am. Math. Soc. 153 (4) (2025): 1511-1518.
https://doi.org/10.1090/proc/17142

Z. Hunter, A. Milojević, B. Sudakov, I. Tomon. Kővári-Sós-Turán theorem for hereditary families. Journal of Combinatorial Theory, Series B 172 (2025): 168-197.
https://doi.org/10.1016/j.jctb.2024.12.009

2024

R. A. Çiçeksiz , Z. Jin, E. Räty, I. Tomon. Exponential Erdős-Szekeres theorem for matrices. Proc. London Math. Soc. 129 (3) (2024): e12632.
https://doi.org/10.1112/plms.12632

O. Janzer, B. Sudakov, I. Tomon. Regular subgraphs of linear hypergraphs. IMRN 2024 (17) (2024): 12366–12381.

https://doi.org/10.1093/imrn/rnae171

O. Janzer, B. Sudakov, I. Tomon. Small subgraphs with large average degree. Combinatorica 44 (2024): 785-800.
https://doi.org/10.1007/s00493-024-00091-6

also in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA): 2345-2353.

I. Tomon. Robust (rainbow) subdivisions and simplicial cycles. Advances in Combinatorics 1 (2024): 37pp.

https://doi.org/10.19086/aic.2024.1

I. Tomon. Tiling with Monotone Polyominos. The American Mathematical Monthly 131 (1) (2024): 60-65.
https://doi.org/10.1080/00029890.2023.2265284

I. Tomon. String graphs have the Erdős-Hajnal property. JEMS 26 (1) (2024): 275-287.

https://doi.org/10.4171/JEMS/1362

I. Tomon. Coloring lines and Delaunay graphs with respect to boxes. Random Structures & Algorithms 64 (2024): 645-662.
https://doi.org/10.1002/rsa.21193

B. Sudakov, I. Tomon. Evasive sets, covering by subspaces, and point-hyperplane incidences. Discrete Comput. Geom. 72 (2024): 1333–1347.

https://doi.org/10.1007/s00454-023-00601-1

2023

I. Tomon. Lower bounds for piercing and coloring boxes. Adv. Math. 435 (2023): 109360.
https://doi.org/10.1016/j.aim.2023.109360

Z. Jin, I. Tomon. Ramsey numbers of semi-algebraic and semi-linear hypergraphs. Journal of Combinatorial Theory, Series B 163 (2023): 54-82.

https://doi.org/10.1016/j.jctb.2023.07.002

D. Bradač, O. Janzer, B. Sudakov, I. Tomon. The Turán number of the grid. Bulletin of London Math. Soc. 55 (1) (2023): 194-204.

https://doi.org/10.1112/blms.12721

I. Tomon. Ramsey properties of semilinear graphs. Israel Journal of Mathematics 254 (2023): 113–139.

https://doi.org/10.1007/s11856-022-2390-7

2022

B. Sudakov, I. Tomon. Ramsey properties of algebraic graphs and hypergraphs. Forum of Mathematics, Sigma 10 (2022): e95.

https://doi.org/10.1017/fms.2022.85

L. Gishboliner, I. Tomon. Polynomial removal lemmas for ordered graphs. Combinatorial Theory 2 (3) (2022): #3.

https://doi.org/10.5070/C62359151

A. Kupavskii, A. Polyanskii, I. Tomon, D. Zakharov. The extremal number of surfaces. IMRN 2022 (17) (2022): 13246-13271.

https://doi.org/10.1093/imrn/rnab099

L. Gishboliner, B. Sudakov, I. Tomon. Small doubling, atomic structure and ℓ-divisible set families. Discrete Analysis 11 (2022): 16pp.

https://doi.org/10.19086/da.38586

L. Gishboliner, I. Tomon. On 3-graphs with no four vertices spanning exactly two edges. Bulletin of London Math. Soc. 54 (6) (2022): 2117-2134.

https://doi.org/10.1112/blms.12681

A. Methuku, I. Tomon. Bipartite Turán problems for ordered graphs. Combinatorica 42 (2022): 895-911.

https://doi.org/10.1007/s00493-021-4296-0

B. Sudakov, I. Tomon, A. Zs. Wagner. Uniform chain decompositions and applications. Random Structures & Algorithms 60 (2) (2022): 261-286.

https://doi.org/10.1002/rsa.21034

B. Sudakov, I.Tomon, A. Zs. Wagner. Infinite Sperner's theorem. Journal of Combinatorial Theory, Series A 187 (2022): 105558.

https://doi.org/10.1016/j.jcta.2021.105558

I. Tomon. A sharp threshold phenomenon in string graphs. Disc. Comput. Geom. 67 (2022): 338-359.

https://doi.org/10.1007/s00454-021-00279-3

B. Sudakov, I. Tomon. The extremal number of tight cycles. IMRN 2022 (13) (2022): 9663-9684.

https://doi.org/10.1093/imrn/rnaa396

2021

J. Pach, I. Tomon. Erdős-Hajnal-type results for ordered paths. Journal of Combinatorial Theory, Series B 151 (2021): 21-37.

https://doi.org/10.1016/j.jctb.2021.05.004

I. Tomon, D. Zakharov. Turán type results for intersection graphs of boxes. Combinatorics, Probability and Computing 30 (6) (2021): 982-987.

https://doi.org/10.1017/S0963548321000171

A. Suk, I. Tomon. Hasse diagrams with large chromatic number. Bulletin of London Math. Soc. 53 (3) (2021): 747-758.

https://doi.org/10.1112/blms.12457

D. Munha Correia, B. Sudakov, I. Tomon. Flattening rank and its combinatorial applications. Linear Algebra and its Applications 625 (2021): 113-125.

https://doi.org/10.1016/j.laa.2021.05.002

2014-2020

D. Korándi, J. Pach, I. Tomon. Large homogeneous submatrices. SIAM J. Discrete Math. 34 (4) (2020): 2532-2552.

https://doi.org/10.1137/19M125786X

J. Pach, I. Tomon. Colorings with only rainbow arithmetic progressions. Acta Mathematica Hungarica 161 (2) (2020): 507-515.

https://doi.org/10.1007/s10474-020-01076-9

B. Sudakov, I. Tomon. The Turán number of bipartite graphs with no Kt,t. Proceedings of the American Mathematical Society 148 (7) (2020): 2811-2818.

https://doi.org/10.1090/proc/15042

J. Pach, I. Tomon. On the chromatic number of disjointness graphs of curves. Journal of Combinatorial Theory, Series B 144 (2020): 167-190.

https://doi.org/10.1016/j.jctb.2020.02.003

D. Korándi, I. Tomon. Improved Ramsey-type results in comparability graphs. Combinatorics, Probability and Computing 29 (5) (2020): 747-756.

https://doi.org/10.1017/S0963548320000103

I. Tomon. Packing the Boolean lattice with copies of a poset. Journal of London Mathematical Society 101 (2) (2020): 589-611.

https://doi.org/10.1112/jlms.12278

J. Pach, I. Tomon. Ordered graphs and large bi-cliques in intersection graphs of curves. European Journal of Combinatorics 82 (2019): 102994.

https://doi.org/10.1016/j.ejc.2019.07.005

I. Tomon. Forbidden induced subposets of given height. Journal of Combinatorial Theory, Series A 161 (2019): 537-562.

https://doi.org/10.1016/j.jcta.2018.09.008

D. Korándi, G. Tardos, I. Tomon, C. Weidert. On the Turán number of ordered forests. Journal of Combinatorial Theory, Series A 165 (2019): 32-43.

https://doi.org/10.1016/j.jcta.2019.01.006

V. Gruslys, I. Leader, I. Tomon. Partitioning the Boolean lattice into copies of a poset. Journal of Combinatorial Theory, Series A 161 (2019): 81-98.

https://doi.org/10.1016/j.jcta.2018.07.003

A. Kupavskii, J. Pach, I. Tomon. On the size of k-cross-free families. Combinatorica 39 (1) (2019): 153-164.

https://doi.org/10.1007/s00493-017-3792-8

B. P. Narayanan, J. Sahasrabudhe, I. Tomon. Ramsey graphs induce subgraphs with many different sizes. Combinatorica 39 (2019): 215-237.

https://doi.org/10.1007/s00493-017-3755-0

E. Győri, D. Korándi, A. Methuku, C. Tompkins, I. Tomon, M. Vizér. On the Turán number of some ordered even cycles. European Journal of Combinatorics 73 (2018): 81-88.

https://doi.org/10.1016/j.ejc.2018.05.008

I. Tomon. Almost Tiling of the Boolean Lattice with Copies of a Poset. Electronic Journal of Combinatorics 25 (1) (2018): P1.38.

http://dx.doi.org/10.37236/6636

B. P. Narayanan, I. Tomon. Induced subgraphs with many distinct degrees. Combinatorics, Probability and Computing 27 (1) (2018): 110-123.

https://doi.org/10.1017/S0963548317000256

S.G.Z. Smith, I. Tomon. The poset on connected graphs is Sperner. Journal of Combinatorial Theory, Series A 150 (2017): 162-181.

https://doi.org/10.1016/j.jcta.2017.03.003

B. P. Narayanan, J. Sahasrabudhe, I. Tomon. The multiplication table problem for bipartite graphs. Combinatorica 37 (5) (2017): 991-1010.

https://doi.org/10.1007/s00493-016-3322-0

I. Tomon. Turán-type results for complete h-partite graphs in comparability and incomparability graphs. Order 33 (3) (2016): 537-556.

https://doi.org/10.1007/s11083-015-9384-6

I. Tomon. Decompositions of the Boolean lattice into rank-symmetric chains. The Electronic Journal of Combinatorics 23 (2) (2016): P2.53.

https://doi.org/10.37236/5328

I. Tomon. Improved bounds on the partitioning of the Boolean lattice into chains of equal size. Discrete Mathematics 339 (1) (2016): 333-343.

https://doi.org/10.1016/j.disc.2015.08.025

I. Tomon. On a conjecture of Füredi. European Journal of Combinatorics 49 (2015): 1-12.

https://doi.org/10.1016/j.ejc.2015.02.026

I. Tomon. On the chromatic number of regular graphs of matrix algebras. Linear Algebra and its Applications 475 (2015): 154-162.

https://doi.org/10.1016/j.laa.2015.02.030

I. Tomon. On the number of occurrences of the k-th smallest distance between points in convex position. Discrete Mathematics 338 (6) (2015): 990-993.

https://doi.org/10.1016/j.disc.2015.01.019

I. Tomon. Point sets with every triangle having a large angle. Moscow Journal of Combinatorics and Number Theory 4 (3) (2014): 40-68.

http://mjcnt.phystech.edu/en/article.php?id=85

Conference versions of some papers

J. Pach, I. Tomon. Coloring Hasse Diagrams and Disjointness Graphs of Curves. in: International Symposium on Graph Drawing and Network Visualization (2019): 244-250. Springer, Cham

J. Pach, I. Tomon. On the chromatic number of disjointness graphs of curves. in:35th International Symposium on Computational Geometry, SoCG 2019,129 Leibniz Zentrum, Dagstuhl (2019): 54:1--54:17.

Page updated

Google Sites

Report abuse