| Publication | Date of Publication | Type |
|---|
Strong modeling limits of graphs with bounded tree-width (available as arXiv preprint) | N/A | Paper |
Common graphs with arbitrary chromatic number (available as arXiv preprint) | N/A | Paper |
Twin-width of graphs on surfaces (available as arXiv preprint) | N/A | Paper |
The dimension of the feasible region of pattern densities (available as arXiv preprint) | N/A | Paper |
Branch-depth is minor closure of contraction-deletion-depth (available as arXiv preprint) | N/A | Paper |
Ramsey multiplicity of apices of trees (available as arXiv preprint) | N/A | Paper |
Hypergraphs with uniform Turán density equal to 8/27 Combinatorics, Probability and Computing | 2026-07-24 | Paper |
Strong modeling limits of graphs with bounded tree-width European Journal of Combinatorics | 2026-07-09 | Paper |
Convergence of spectra of digraph limits European Journal of Combinatorics | 2026-07-09 | Paper |
| Twin-width of graphs on surfaces | 2026-05-12 | Paper |
| Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming | 2026-03-18 | Paper |
Convergence of spectra of digraph limits (available as arXiv preprint) | 2026-01-01 | Paper |
Sidorenko property and forcing in regular tournaments (available as arXiv preprint) | 2026-01-01 | Paper |
Fundamental cycles in grid graphs (available as arXiv preprint) | 2026-01-01 | Paper |
Solution of uniform Turán's Tetrahedron Problem (available as arXiv preprint) | 2026-01-01 | Paper |
Closure property of contraction-depth of matroids Journal of Combinatorial Theory. Series B | 2025-09-16 | Paper |
| Common systems of two equations over the binary field | 2025-08-01 | Paper |
Common graphs with arbitrary chromatic number Compositio Mathematica | 2025-07-27 | Paper |
The dimension of the region of feasible tournament profiles SIAM Journal on Discrete Mathematics | 2025-07-10 | Paper |
| Deciding first-order properties for sparse graphs | 2025-04-29 | Paper |
| Forcing generalized quasirandom graphs efficiently (extended abstract) | 2025-04-15 | Paper |
| The dimension of the feasible region of pattern densities (extended abstract) | 2025-04-15 | Paper |
The dimension of the feasible region of pattern densities Mathematical Proceedings of the Cambridge Philosophical Society | 2025-03-12 | Paper |
Uniform Turán density -- palette classification (available as arXiv preprint) | 2025-01-01 | Paper |
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
Forcing generalised quasirandom graphs efficiently Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Cycles of length three and four in tournaments Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
More non-bipartite forcing pairs Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Planar graph with twin-width seven European Journal of Combinatorics | 2024-10-07 | Paper |
| Hypergraphs with minimum positive uniform Turán density | 2024-09-13 | Paper |
| Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming | 2024-06-24 | Paper |
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Hypergraphs with uniform Turán density equal to 8/27 (available as arXiv preprint) | 2024-01-01 | Paper |
Forcing quasirandomness with 4-point permutations (available as arXiv preprint) | 2024-01-01 | Paper |
Four-coloring Eulerian triangulations of the torus (available as arXiv preprint) | 2024-01-01 | Paper |
Curves on the torus with few intersections (available as arXiv preprint) | 2024-01-01 | Paper |
Quasirandom-Forcing Orientations of Cycles SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
| Closure property of contraction-depth of matroids | 2023-11-03 | Paper |
| The dimension of the region of feasible tournament profiles | 2023-10-30 | Paper |
Quasirandom Latin squares Random Structures & Algorithms | 2023-10-17 | Paper |
Toward characterizing locally common graphs Random Structures & Algorithms | 2023-10-17 | Paper |
Uniform Turán density of cycles Transactions of the American Mathematical Society | 2023-07-10 | Paper |
| Forcing Generalized Quasirandom Graphs Efficiently | 2023-03-07 | Paper |
No additional tournaments are quasirandom-forcing European Journal of Combinatorics | 2022-12-01 | Paper |
Cycles of a given length in tournaments Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
Inducibility and universality for trees Combinatorial Theory | 2022-11-23 | Paper |
Density maximizers of layered permutations The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
| Planar graph with twin-width seven | 2022-09-23 | Paper |
Non-bipartite \(k\)-common graphs Combinatorica | 2022-06-30 | Paper |
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming SIAM Journal on Computing | 2022-06-08 | Paper |
Packing and covering directed triangles asymptotically European Journal of Combinatorics | 2022-01-13 | Paper |
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
Recovering sparse graphs (available as arXiv preprint) | 2021-08-04 | Paper |
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies Journal of Combinatorial Theory. Series B | 2021-07-06 | Paper |
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs Journal of Combinatorial Theory. Series B | 2021-07-06 | Paper |
Coloring graphs by translates in the circle European Journal of Combinatorics | 2021-06-18 | Paper |
Elusive extremal graphs Proceedings of the London Mathematical Society | 2021-05-10 | Paper |
Cyclic coloring of plane graphs with maximum face size 16 and 17 European Journal of Combinatorics | 2021-04-14 | Paper |
Analytic representations of large graphs Surveys in Combinatorics 2019 | 2021-02-06 | Paper |
Characterization of quasirandom permutations by a pattern sum Random Structures & Algorithms | 2021-01-05 | Paper |
Finitely forcible graphons with an almost arbitrary structure Discrete Analysis | 2020-10-20 | Paper |
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Cycles of length three and four in tournaments Journal of Combinatorial Theory. Series A | 2020-07-03 | Paper |
Permutations with fixed pattern densities Random Structures & Algorithms | 2020-06-19 | Paper |
Non-bipartite k-common graphs (available as arXiv preprint) | 2020-06-16 | Paper |
| Hadwiger meets Cayley | 2020-05-12 | Paper |
Decomposing graphs into edges and triangles Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Hadwiger meets Cayley (available as arXiv preprint) | 2020-01-01 | Paper |
Compactness and finite forcibility of graphons Journal of the European Mathematical Society (JEMS) | 2019-10-15 | Paper |
Hereditary properties of permutations are strongly testable Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| More non-bipartite forcing pairs | 2019-06-10 | Paper |
Packing directed cycles through a specified vertex set Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Infinite-dimensional finitely forcible graphon Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
Infinite-dimensional finitely forcible graphon Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
| Coloring triangle-free graphs on surfaces | 2019-05-06 | Paper |
Optimal‐size clique transversals in chordal graphs Journal of Graph Theory | 2019-01-03 | Paper |
Optimal‐size clique transversals in chordal graphs Journal of Graph Theory | 2019-01-03 | Paper |
The step Sidorenko property and non-norming edge-transitive graphs Journal of Combinatorial Theory. Series A | 2018-12-19 | Paper |
The step Sidorenko property and non-norming edge-transitive graphs Journal of Combinatorial Theory. Series A | 2018-12-19 | Paper |
A bound on the inducibility of cycles Journal of Combinatorial Theory. Series A | 2018-11-08 | Paper |
A bound on the inducibility of cycles Journal of Combinatorial Theory. Series A | 2018-11-08 | Paper |
Finitely forcible graph limits are universal Advances in Mathematics | 2018-11-08 | Paper |
Finitely forcible graph limits are universal Advances in Mathematics | 2018-11-08 | Paper |
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk Journal of Combinatorial Theory. Series B | 2018-07-24 | Paper |
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk Journal of Combinatorial Theory. Series B | 2018-07-24 | Paper |
Graphic TSP in cubic graphs (available as arXiv preprint) | 2018-04-19 | Paper |
Walk entropy and walk-regularity Linear Algebra and its Applications | 2018-04-12 | Paper |
Walk entropy and walk-regularity Linear Algebra and its Applications | 2018-04-12 | Paper |
Weak regularity and finitely forcible graph limits Transactions of the American Mathematical Society | 2018-03-28 | Paper |
Counting flags in triangle-free digraphs Combinatorica | 2018-03-16 | Paper |
| Extremal graph theory and finite forcibility | 2018-01-18 | Paper |
Elusive extremal graphs (available as arXiv preprint) | 2018-01-01 | Paper |
First-Order Convergence and Roots Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Recovering sparse graphs (available as arXiv preprint) | 2017-09-28 | Paper |
First order limits of sparse graphs: plane trees and path-width Random Structures & Algorithms | 2017-08-10 | Paper |
First order limits of sparse graphs: plane trees and path-width Random Structures & Algorithms | 2017-08-10 | Paper |
Steinberg's conjecture is false Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Densities in large permutations and parameter testing European Journal of Combinatorics | 2016-11-07 | Paper |
Third case of the cyclic coloring conjecture (available as arXiv preprint) | 2016-10-14 | Paper |
Weak regularity and finitely forcible graph limits (available as arXiv preprint) | 2016-10-14 | Paper |
| Weak regularity and finitely forcible graph limits | 2016-10-14 | Paper |
First order convergence of matroids European Journal of Combinatorics | 2016-10-12 | Paper |
| Densities of 3-vertex graphs | 2016-10-07 | Paper |
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. Journal of Combinatorial Theory. Series B | 2016-06-03 | Paper |
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. Journal of Combinatorial Theory. Series B | 2016-06-03 | Paper |
A problem of Erdős and Sós on 3-graphs Israel Journal of Mathematics | 2016-04-21 | Paper |
Third case of the cyclic coloring conjecture SIAM Journal on Discrete Mathematics | 2016-04-04 | Paper |
FO model checking of interval graphs Logical Methods in Computer Science | 2016-01-07 | Paper |
Densities of 3-vertex graphs (available as arXiv preprint) | 2016-01-01 | Paper |
Packing six \(T\)-joins in plane graphs Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |