István Tomon

CoRR, April, 2026

Explicit Constructions of Optimal Blocking Sets and Minimal Codes.

[BibT_eX]

[DOI]

Anurag Bishnoi

Comb., April, 2026

Bisection width, discrepancy, and eigenvalues of hypergraphs.

[BibT_eX]

[DOI]

Eero Räty

J. Comb. Theory B, 2026

Communication Complexity of Disjointness under Product Distributions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2026

2025

Matrix discrepancy and the log-rank conjecture.

[BibT_eX]

[DOI]

Math. Program., July, 2025

C<sub>4</sub>-free subgraphs of high degree with geometric applications.

[BibT_eX]

[DOI]

CoRR, June, 2025

Factorization norms and Zarankiewicz problems.

[BibT_eX]

[DOI]

CoRR, February, 2025

Kővári-Sós-Turán theorem for hereditary families.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

Factorization norms and an inverse theorem for MaxCut.

[BibT_eX]

[DOI]

Igor Balla

Lianna Hambardzumyan

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Coloring lines and Delaunay graphs with respect to boxes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2024

Tiling with Monotone Polyominos.

[BibT_eX]

[DOI]

Am. Math. Mon., January, 2024

Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2024

The Quantitative Fractional Helly theorem.

[BibT_eX]

[DOI]

Nóra Frankl

Attila Jung

CoRR, 2024

2023

Ramsey numbers of semi-algebraic and semi-linear hypergraphs.

[BibT_eX]

[DOI]

Zhihan Jin

J. Comb. Theory B, November, 2023

Small subgraphs with large average degree.

[BibT_eX]

[DOI]

Oliver Janzer

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Uniform chain decompositions and applications.

[BibT_eX]

[DOI]

Adam Zsolt Wagner

Random Struct. Algorithms, 2022

Infinite Sperner's theorem.

[BibT_eX]

[DOI]

Adam Zsolt Wagner

J. Comb. Theory A, 2022

A Sharp Threshold Phenomenon in String Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Polynomial removal lemmas for ordered graphs.

[BibT_eX]

[DOI]

Lior Gishboliner

Comb. Theory, 2022

Bipartite Turán Problems for Ordered Graphs.

[BibT_eX]

[DOI]

Abhishek Methuku

Comb., 2022

2021

Erdős-Hajnal-type results for monotone paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Turán-type results for intersection graphs of boxes.

[BibT_eX]

[DOI]

Dmitriy Zakharov

Comb. Probab. Comput., 2021

2020

Large Homogeneous Submatrices.

[BibT_eX]

[DOI]

Dániel Korándi

SIAM J. Discret. Math., 2020

Improved Ramsey-type results for comparability graphs.

[BibT_eX]

[DOI]

Dániel Korándi

Comb. Probab. Comput., 2020

2019

Forbidden induced subposets of given height.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Partitioning the Boolean lattice into copies of a poset.

[BibT_eX]

[DOI]

Vytautas Gruslys

Imre Leader

J. Comb. Theory A, 2019

Ordered graphs and large bi-cliques in intersection graphs of curves.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Ramsey Graphs Induce Subgraphs of Many Different Sizes.

[BibT_eX]

[DOI]

Bhargav P. Narayanan

Julian Sahasrabudhe

Comb., 2019

On the Size of K-Cross-Free Families.

[BibT_eX]

[DOI]

Andrey Kupavskii

Comb., 2019

Coloring Hasse Diagrams and Disjointness Graphs of Curves.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On the Chromatic Number of Disjointness Graphs of Curves.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

On the Turán number of some ordered even cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Induced Subgraphs With Many Distinct Degrees.

[BibT_eX]

[DOI]

Bhargav P. Narayanan

Comb. Probab. Comput., 2018

Almost Tiling of the Boolean Lattice with Copies of a Poset.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

The poset on connected graphs is Sperner.

[BibT_eX]

[DOI]

Stephen G. Z. Smith

J. Comb. Theory A, 2017

On the Turán number of ordered forests.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Tiling the Boolean lattice with copies of a poset.

[BibT_eX]

[DOI]

Vytautas Gruslys

Imre Leader

Electron. Notes Discret. Math., 2017

The multiplication table problem for bipartite graphs.

[BibT_eX]

[DOI]

Bhargav P. Narayanan

Julian Sahasrabudhe

Comb., 2017

2016

Turán-Type Results for Complete h-Partite Graphs in Comparability and Incomparability Graphs.

[BibT_eX]

[DOI]

Order, 2016

Improved bounds on the partitioning of the Boolean lattice into chains of equal size.

[BibT_eX]

[DOI]

Discret. Math., 2016

Decompositions of the Boolean Lattice into Rank-symmetric Chains.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

On a conjecture of Füredi.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

On the number of occurrences of the kth smallest distance between points in convex position.

[BibT_eX]

[DOI]