On the number of occurrences of the kth smallest distance between points in convex position. - István Tomon (Discret. Math., 2015)

On a conjecture of Füredi. - István Tomon (Eur. J. Comb., 2015)

Decompositions of the Boolean Lattice into Rank-symmetric Chains. - István Tomon (Electron. J. Comb., 2016)

Improved bounds on the partitioning of the Boolean lattice into chains of equal size. - István Tomon (Discret. Math., 2016)

Turán-Type Results for Complete h-Partite Graphs in Comparability and Incomparability Graphs. - István Tomon (Order, 2016)

The multiplication table problem for bipartite graphs. - Bhargav P. Narayanan; Julian Sahasrabudhe; István Tomon (Comb., 2017)

Tiling the Boolean lattice with copies of a poset. - Vytautas Gruslys; Imre Leader; István Tomon (Electron. Notes Discret. Math., 2017)

The poset on connected graphs is Sperner. - Stephen G. Z. Smith; István Tomon (J. Comb. Theory A, 2017)

Almost Tiling of the Boolean Lattice with Copies of a Poset. - István Tomon (Electron. J. Comb., 2018)

Induced Subgraphs With Many Distinct Degrees. - Bhargav P. Narayanan; István Tomon (Comb. Probab. Comput., 2018)

On the Turán number of some ordered even cycles. - Ervin Györi; Dániel Korándi; Abhishek Methuku; István Tomon; Casey Tompkins; Máté Vizer (Eur. J. Comb., 2018)

Coloring Hasse Diagrams and Disjointness Graphs of Curves. - János Pach; István Tomon (GD, 2019)

On the Size of K-Cross-Free Families. - Andrey Kupavskii; János Pach; István Tomon (Comb., 2019)

Ramsey Graphs Induce Subgraphs of Many Different Sizes. - Bhargav P. Narayanan; Julian Sahasrabudhe; István Tomon (Comb., 2019)

Ordered graphs and large bi-cliques in intersection graphs of curves. - János Pach; István Tomon (Eur. J. Comb., 2019)

Partitioning the Boolean lattice into copies of a poset. - Vytautas Gruslys; Imre Leader; István Tomon (J. Comb. Theory A, 2019)

On the Turán number of ordered forests. - Dániel Korándi; Gábor Tardos; István Tomon; Craig Weidert (J. Comb. Theory A, 2019)

Forbidden induced subposets of given height. - István Tomon (J. Comb. Theory A, 2019)

Improved Ramsey-type results for comparability graphs. - Dániel Korándi; István Tomon (Comb. Probab. Comput., 2020)

On the chromatic number of disjointness graphs of curves. - János Pach; István Tomon (J. Comb. Theory B, 2020)

Large Homogeneous Submatrices. - Dániel Korándi; János Pach; István Tomon (SIAM J. Discret. Math., 2020)

Turán-type results for intersection graphs of boxes. - István Tomon; Dmitriy Zakharov (Comb. Probab. Comput., 2021)

Erdős-Hajnal-type results for monotone paths. - János Pach; István Tomon (J. Comb. Theory B, 2021)

Bipartite Turán Problems for Ordered Graphs. - Abhishek Methuku; István Tomon (Comb., 2022)

Polynomial removal lemmas for ordered graphs. - Lior Gishboliner; István Tomon (Comb. Theory, 2022)

A Sharp Threshold Phenomenon in String Graphs. - István Tomon (Discret. Comput. Geom., 2022)

Infinite Sperner's theorem. - Benny Sudakov; István Tomon; Adam Zsolt Wagner (J. Comb. Theory A, 2022)

Uniform chain decompositions and applications. - Benny Sudakov; István Tomon; Adam Zsolt Wagner (Random Struct. Algorithms, 2022)

Ramsey numbers of semi-algebraic and semi-linear hypergraphs. - Zhihan Jin; István Tomon (J. Comb. Theory B, 2023)

The Quantitative Fractional Helly theorem. - Nóra Frankl; Attila Jung; István Tomon (CoRR, 2024)

Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs. - Eero Räty; István Tomon (CoRR, 2024)

Explicit constructions of optimal blocking sets and minimal codes. - Anurag Bishnoi; István Tomon (CoRR, 2024)

Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences. - Benny Sudakov; István Tomon (Discret. Comput. Geom., 2024)

Tiling with Monotone Polyominos. - István Tomon (Am. Math. Mon., 2024)

Coloring lines and Delaunay graphs with respect to boxes. - István Tomon (Random Struct. Algorithms, 2024)

Small Subgraphs with Large Average Degree. - Oliver Janzer; Benny Sudakov; István Tomon (Comb., 2024)

Factorization norms and an inverse theorem for MaxCut. - Igor Balla; Lianna Hambardzumyan; István Tomon (Electron. Colloquium Comput. Complex., 2025)

Kővári-Sós-Turán theorem for hereditary families. - Zach Hunter; Aleksa Milojevic; Benny Sudakov; István Tomon (J. Comb. Theory B, 2025)

Factorization norms and Zarankiewicz problems. - István Tomon (CoRR, 2025)

C4-free subgraphs of high degree with geometric applications. - Zach Hunter; Aleksa Milojevic; István Tomon; Benny Sudakov (CoRR, 2025)

Matrix discrepancy and the log-rank conjecture. - Benny Sudakov; István Tomon (Math. Program., 2025)