István Tomon

50 papers A* 3A 1Journal 46
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bisection width, discrepancy, and eigenvalues of hypergraphs.
J. Comb. Theory B
Eero Räty, István Tomon
2026 J jnl
Communication Complexity of Disjointness under Product Distributions.
CoRR
Zach Hunter, Aleksa Milojevic, Benny Sudakov, István Tomon
2026 J jnl
Explicit Constructions of Optimal Blocking Sets and Minimal Codes.
Comb.
Anurag Bishnoi, István Tomon
2025 J jnl
C
CoRR
Zach Hunter, Aleksa Milojevic, István Tomon, Benny Sudakov
2025 J jnl
Factorization norms and Zarankiewicz problems.
CoRR
István Tomon
2025 A* conf
Factorization norms and an inverse theorem for MaxCut.
FOCS
Igor Balla, Lianna Hambardzumyan, István Tomon
2025 J jnl
Factorization norms and an inverse theorem for MaxCut.
CoRR
Igor Balla, Lianna Hambardzumyan, István Tomon
2025 J jnl
Factorization norms and an inverse theorem for MaxCut.
Electron. Colloquium Comput. Complex.
Igor Balla, Lianna Hambardzumyan, István Tomon
2025 J jnl
Kővári-Sós-Turán theorem for hereditary families.
J. Comb. Theory B
Zach Hunter, Aleksa Milojevic, Benny Sudakov, István Tomon
2025 J jnl
Matrix discrepancy and the log-rank conjecture.
Math. Program.
Benny Sudakov, István Tomon
2024 J jnl
Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs.
CoRR
Eero Räty, István Tomon
2024 J jnl
Coloring lines and Delaunay graphs with respect to boxes.
Random Struct. Algorithms
István Tomon
2024 J jnl
Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences.
Discret. Comput. Geom.
Benny Sudakov, István Tomon
2024 J jnl
Explicit constructions of optimal blocking sets and minimal codes.
CoRR
Anurag Bishnoi, István Tomon
2024 J jnl
Small Subgraphs with Large Average Degree.
Comb.
Oliver Janzer, Benny Sudakov, István Tomon
2024 J jnl
The Quantitative Fractional Helly theorem.
CoRR
Nóra Frankl, Attila Jung, István Tomon
2024 J jnl
Tiling with Monotone Polyominos.
Am. Math. Mon.
István Tomon
2023 J jnl
Matrix discrepancy and the log-rank conjecture.
CoRR
Benny Sudakov, István Tomon
2023 J jnl
Ramsey numbers of semi-algebraic and semi-linear hypergraphs.
J. Comb. Theory B
Zhihan Jin, István Tomon
2023 A* conf
Small subgraphs with large average degree.
SODA
Oliver Janzer, Benny Sudakov, István Tomon
2022 J jnl
A Sharp Threshold Phenomenon in String Graphs.
Discret. Comput. Geom.
István Tomon
2022 J jnl
Bipartite Turán Problems for Ordered Graphs.
Comb.
Abhishek Methuku, István Tomon
2022 J jnl
Infinite Sperner's theorem.
J. Comb. Theory A
Benny Sudakov, István Tomon, Adam Zsolt Wagner
2022 J jnl
Polynomial removal lemmas for ordered graphs.
Comb. Theory
Lior Gishboliner, István Tomon
2022 J jnl
Uniform chain decompositions and applications.
Random Struct. Algorithms
Benny Sudakov, István Tomon, Adam Zsolt Wagner
2021 J jnl
Erdős-Hajnal-type results for monotone paths.
J. Comb. Theory B
János Pach, István Tomon
2021 J jnl
Turán-type results for intersection graphs of boxes.
Comb. Probab. Comput.
István Tomon, Dmitriy Zakharov
2020 J jnl
Improved Ramsey-type results for comparability graphs.
Comb. Probab. Comput.
Dániel Korándi, István Tomon
2020 J jnl
Large Homogeneous Submatrices.
SIAM J. Discret. Math.
Dániel Korándi, János Pach, István Tomon
2020 J jnl
On the chromatic number of disjointness graphs of curves.
J. Comb. Theory B
János Pach, István Tomon
2019 A conf
Coloring Hasse Diagrams and Disjointness Graphs of Curves.
GD
János Pach, István Tomon
2019 J jnl
Forbidden induced subposets of given height.
J. Comb. Theory A
István Tomon
2019 A* conf
On the Chromatic Number of Disjointness Graphs of Curves.
SoCG
János Pach, István Tomon
2019 J jnl
On the Size of K-Cross-Free Families.
Comb.
Andrey Kupavskii, János Pach, István Tomon
2019 J jnl
On the Turán number of ordered forests.
J. Comb. Theory A
Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert
2019 J jnl
Ordered graphs and large bi-cliques in intersection graphs of curves.
Eur. J. Comb.
János Pach, István Tomon
2019 J jnl
Partitioning the Boolean lattice into copies of a poset.
J. Comb. Theory A
Vytautas Gruslys, Imre Leader, István Tomon
2019 J jnl
Ramsey Graphs Induce Subgraphs of Many Different Sizes.
Comb.
Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon
2018 J jnl
Almost Tiling of the Boolean Lattice with Copies of a Poset.
Electron. J. Comb.
István Tomon
2018 J jnl
Induced Subgraphs With Many Distinct Degrees.
Comb. Probab. Comput.
Bhargav P. Narayanan, István Tomon
2018 J jnl
On the Turán number of some ordered even cycles.
Eur. J. Comb.
Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer
2017 J jnl
On the Turán number of ordered forests.
Electron. Notes Discret. Math.
Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert
2017 J jnl
The multiplication table problem for bipartite graphs.
Comb.
Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon
2017 J jnl
The poset on connected graphs is Sperner.
J. Comb. Theory A
Stephen G. Z. Smith, István Tomon
2017 J jnl
Tiling the Boolean lattice with copies of a poset.
Electron. Notes Discret. Math.
Vytautas Gruslys, Imre Leader, István Tomon
2016 J jnl
Decompositions of the Boolean Lattice into Rank-symmetric Chains.
Electron. J. Comb.
István Tomon
2016 J jnl
Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
Discret. Math.
István Tomon
2016 J jnl
Turán-Type Results for Complete h-Partite Graphs in Comparability and Incomparability Graphs.
Order
István Tomon
2015 J jnl
On a conjecture of Füredi.
Eur. J. Comb.
István Tomon
2015 J jnl
On the number of occurrences of the kth smallest distance between points in convex position.
Discret. Math.
István Tomon