In 2015, Balogh introduced the Erdős-coloring of a paper. A paper is colored red if it answers a question or solves a conjecture by P. Erdős. If it gives a current best bound on a problem by P. Erdős, it is colored pink.
Submitted
[30] Behague, Clemen, Hyde, Morrison, A minimum-degree threshold for colour-biased Hamilton cycles in hypergraphs, arXiv: 2607.29628, 2026.
[29] Clemen, Führer, Roche-Newton, Geometric Sidon Problems, arXiv: 2606.05841, 2026
[28] Chen, Clemen, Noel, On Tournament Anti-Sidorenko Orientations of Trees, arXiv: 2605.14138, 2026.
[27] Chen, Clemen, Noel, Maximizing Alternating Paths via Entropy, arXiv: 2505.03903, 2025.
[26] Balogh, Clemen, Dumitrescu, Liu, Subset Selection Problems in Planar Point Sets, arXiv: 2412.14287, 2024.
Appeared
[25] Clemen, Dumitrescu, Liu, The number of regular simplices in higher dimensions, Bulletin of the London Mathematical Society, 2026.
[24] Clemen, Kaiser, Crossing Numbers of Billiard Curves in the Multidimensional Box via Translation Manifolds, Australasian Journal in Combinatorics, 2026.
[23] Clemen, Dumitrescu, Liu, On the Multiplicities of Interpoint Distances, Acta Math. Hungar. , 2025.
[22] Clemen, Applications of Sparse Hypergraph Colorings, Discrete Mathematics, 2026.
[21] Balogh, Clemen, Luo, Non-degenerate Hypergraphs with Exponentially Many Extremal Constructions, Journal of Combinatorial Theory, Series B, 2025.
[20] Clemen, Heath, Lavrov, Online Ramsey numbers of ordered paths and cycles, Electronic Journal of Combinatorics, 2024.
[19] Balogh, Clemen, Dumitrescu, On a Traveling Salesman Problem for Points in the Unit Cube, Algorithmica, 2024.
[18] Balogh, Clemen, Dumitrescu, Almost Congruent Triangles, Discrete & Computational Geometry, 2024.
[17] Balogh, Clemen, Lidický, 10 Problems for Partitions of Triangle-free Graphs, European Journal of Combinatorics, 2024.
[16] Axenovich, Balogh, Clemen, Weber, Unavoidable order-size pairs in hypergraphs - positive forcing density, Combinatorial Theory, 2023.
[15] Axenovich, Clemen, Rainbow Subgraphs in Edge-colored complete Graphs -- Answering Two Questions by Erdős and Tuza, Journal of Graph Theory, 2023.
[14] Balogh, Clemen, On stability of the Erdős-Rademacher Problem, Illinois Journal of Mathematics, 2020.
[13] Balogh, Clemen , Lidický, Norin, Volec, The Spectrum of Triangle-free Graphs, SIAM Journal on Discrete Math., 2022.
[12] Clemen, Wagner, A note on balanced edge-colorings avoiding rainbow cliques of size four, arXiv:2303.15476, Electronic Journal of Combinatorics, 2023
[11] Cao, Clemen, English, Li, Schmidt, Xoubi, Yin Chasing the Threshold Bias of the 3-AP Game, Australasian Journal of Combinatorics, 2022.
[10] Balogh, Clemen, Lidický Hypergraph Tur\'an Problems in $\ell_2$-Norm, Surveys in Combinatorics 2022: London Math. Soc. Lecture Notes Series, 2021.
[9] Balogh, Clemen, Lidický, Solving Tur\'an's Tetrahedron Problem for the $\ell_2$-Norm, Journal of the London Mathematical Society, 2022.
[8] Balogh, Clemen, Mattos, Counting r-graphs without forbidden configurations, Journal of Combinatorial Theory, Series B, 2022.
[7] Balogh, Clemen, Lidický, Maximum Number of Almost Similar Triangles in the Plane, Computational Geometry: Theory and Applications, 2022.
[6] Balogh, Clemen, Heath, Lavrov, A Strengthening of the Erdős-Szekeres Theorem, Eurpean Journal of Combinatorics, 101, 2022.
[5] Balogh, C., Lidický, Max-Cuts in Triangle-free Graphs, Extended Abstracts EuroComb2021, 2021.
[4] Choi, Clemen, Ferrara, Horn, Ma, Masařík, Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four, Discrete Appl. Math., 2021.
[3] Balogh, Clemen, Lavrov, Lidický, Pfender, Making K_ {r+ 1} -Free Graphs r-partite, Combinatorics Probability and Computing, 2020.
[2] Balogh, Clemen, Skokan, Wagner, The Ramsey Number of Fano Plane Versus Tight Path, Electronic Journal of Combinatorics, 2020.
[1] Balogh, Clemen, Heath, Lavrov, Ordered size Ramsey number of paths, Discrete Appl. Math., 2020.