Publications
2024| 2023 | 2022 | 2021 | | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009
P. Allen, O. Parczyk, V. Pfenninger: Resilience for tight Hamiltonicity. Submitted (2021). https://arxiv.org/abs/2105.04513
M. Anastos: On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time . Submitted (2021). https://arxiv.org/abs/2107.03523
M. Anastos: Packing Hamilton Cycles in Cores of Random Graphs. Submitted (2021). https://arxiv.org/abs/2107.03527
M. Anastos: An improved lower bound on the length of the longest cycle in random graphs. Submitted (2022). https://arxiv.org/abs/2208.06851
P. Araújo, T. Martins, L. Mattos, W. Mendonça, L. Moreira, G. O. Mota: On the anti-Ramsey threshold for non-balanced graphs. Submitted (2022). https://arxiv.org/abs/2201.05106
I. Araujo, J. Balogh, L. Mattos: New Lower Bounds For Essential Covers Of The Cube. Submitted (2022). https://arxiv.org/abs/2209.00140
J. Balogh, G. Kronenberg, A. Pokrovskiy, T. Szabó: The maximum length of Kr-Bootstrap Percolation. Submitted (2019). https://arxiv.org/abs/1907.04559
T. Bayer, T. Mészáros, L. Rónyai, T. Szabó, Subgraphes of the Projective Norm Graphs. Submitted (2019). https://arxiv.org/abs/1908.05190
J. Böttcher, N. Frankl, D. Mergoni Cecchelli, O. Parczyk, J. Skokan: Graphs with large minimum degree and no small odd cycles are 3-colourable. Submitted (2023). https://arxiv.org/abs/2302.01875
J. Böttcher, O. Parczyk, A. Sgueglia, J. Skokan, J. The Square of a Hamilton Cycle in Randomly Perturbed Graphs. Submitted (2022). https://arxiv.org/abs/2202.05215
S. Boyadzhiyska, D. Clemens, S. Das, P. Gupta: Ramsey simplicity of random graphs. Submitted (2021). https://arxiv.org/abs/2109.04140
S. Boyadzhiyska, D. Clemens, P. Gupta, J. Rollin: Ramsey equivalence for asymmetric pairs of graphs. SIAM Journal on Discrete Mathematics, Vol. 38, Iss. 1, (2024). https://doi.org/10.1137/23M1558239
S. Boyadzhiyska, T. Lesgourgues: On the use of senders for asymmetric tuples of cliques in Ramsey theory. Submitted (2022). https://arxiv.org/abs/2211.15840
S. Das, N. Draganić, R. Steiner: Tight bounds for divisible subdivisions. Journal of Combinatorial Theory, Series B, Vol. 165, pp. 1-19, (2024). https://doi.org/10.1016/j.jctb.2023.10.011
D. Fabian, P. Morris, T. Szabó: Slow graph bootstrap percolation I: Cycles. Submitted (2023). https://arxiv.org/abs/2308.00498
D. Fabian, P. Morris, T. Szabó: Slow graph bootstrap percolation II: Accelerating properties. Submitted (2023). https://arxiv.org/abs/2311.18786
D. Gerbner, T. Mészáros, A. Methuku, C. Palmer: Generalized rainbow Turán problems. Submitted 2019. https://arxiv.org/abs/1911.06642
M. Hahn-Klimroth, O. Parczyk, Y. Person: Minimum degree conditions for containing an r-regular r-connected subgraph. Submitted (2021). https://arxiv.org/abs/2108.07601
J. Han, P. Morris, G. Wang and D. Yang: A Ramsey-Turán theory for tilings in graphs. Random structures and algorithm, Vol. 64, Issue 1, pp. 94-124, (2024) https://doi.org/10.1002/rsa.21182
A. Lamaison: The random strategy in Maker-Breaker graph minor games. Submitted (2019). https://arxiv.org/abs/1907.04804
L. Mattos, D. Mergoni Cecchelli, O. Parczyk: On product Schur triples in the integers. Submitted (2023). https://arxiv.org/abs/2311.18796
R. Montgomery, R. Nenadov, T. Szabó: Global rigidity of random graphs in ℝ. Submtted (2024). https://arxiv.org/abs/2401.10803
O. Parczyk, S. Pokutta, C. Spiegel, T. Szabó: New Ramsey Multiplicity Bounds and Search Heuristics. Submitted (2022). https://arxiv.org/abs/2206.04036
Tamás Mészáros, Lajos Rónyai, Tibor Szabó: Singer difference sets and the projective norm graph. Submitted (2019). https://arxiv.org/abs/1908.05591
M. Anastos, D. Fabian, A. Müyesser, T. Szabó: Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. The Electronical Journal of Combinatorics, Vol. 30 (3), P 3.10, (2023), https://doi.org/10.37236/11714
Anastos, M. "Fast algorithms for solving the Hamilton Cycle problem with high probability." Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch88
M. Anastos: A note on long cycles in sparse random graphs.The Electronical Journal of Combinatorics, Vol. 30 (2), (2023) https://doi.org/10.37236/11471
M. Anastos: Constructing Hamilton cycles and perfect matchings efficiently. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and ApplicationsEUROCOMB’23, pp. 36-41. (2023). https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-005
J. Balogh, A. Lamaison: Ramsey upper density of infinite graph factors. Illinois J. Math. 67 (1) 171 - 184, April 2023. https://doi.org/10.1215/00192082-10450499
T. Bayer, T. Mészáros, L. Rónyai, T. Szabó: The automorphism group of projective norm graphs. AAECC (2023). https://doi.org/10.1007/s00200-022-00590-3
A. Bishnoi, S. Boyadzhiyska, D. Clemens, P. Gupta, T. Lesgourgues, A. Liebenau: On the minimum degree of minimal Ramsey graphs for cliques versus cycles. SIAM Journal on Discrete Mathematics, Vol. 37, Issue 1 (2023). https://doi.org/10.1137/21M1444953
A. Bishnoi, S. Boyadzhiyska, S. Das, T. Mészáros: Subspace coverings with multiplicities. Combinatorics, Probability and Computing, Vol. 32 (5), pp 782-795, (2023). https://doi.org/10.1017/S0963548323000123
J. Böttcher, O. Parczyk, A. Sgueglia, J. Skokan: Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing, Vol. 32, Issue 1, pp. 91 - 121, (2023) https://doi.org/10.1017/S0963548322000153
P. Gupta, F. Hamann, A. Müyesser, O. Parczyk, A. Sgueglia: A general approach to transversal versions of Dirac-type theorems. Bulletin of the London Mathematical Society, Vol. 55, Issue 6, pp. 2817-2839. (2023). https://doi.org/10.1112/blms.12896
P. Haxell, T. Szabó: Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2875 - 2897, (2023). https://doi.org/10.1137/1.9781611977554.ch109
A. Lamaison: Ramsey upper density of infinite graphs. Combinatorics, Probability and Computing, 32(5):703-723., (2023) https://doi.org/10.1017/S0963548323000093
P. Morris: Clique factors in pseudorandom graphs. J. Eur. Math. Soc. (2023), pp. 1–75. DOI 10.4171/JEMS/1388
M. Anastos, A. Frieze: A scaling limit for the length of the longest cycle in a sparse random diagraph. Random Structures & Algorithms, Vol. 60, Issue 1, pages 3-24, (2022). https://doi.org/10.1002/rsa.21030
M. Anastos, "Solving the Hamilton cycle problem fast on average," 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), Denver, CO, USA, 2022, pp. 919-930, doi: 10.1109/FOCS54457.2022.00091
J. Balogh, F. C. Clemen, L. Mattos: Counting r-graphs without forbidden configurations. Journal of Combinatorial Theory, Series B, Vol. 157, pages 216-234, (2022). https://doi.org/10.1016/j.jctb.2022.07.001
B.A. Berendsohn, S. Boyadzhiyska, L. Kozma: Fixed-Point Cycles and Approximate EFX Allocations. Proceedings of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Vol. 241, pp. 17:1 - 17:13. (2022). https://doi.org/10.4230/LIPIcs.MFCS.2022.17
S. Boyadzhiyska, D. Clemens, P. Gupta: Minimal Ramsey graphs with many vertices of small degree. SIAM Journal on Discrete Mathematics, Vol. 36, Issue 3, (2022), https://doi.org/10.1137/21M1393273
J. W. Cooper, D. Kral, A. Lamaison, S. Mohr: Quasirandom Latin squares. Random Structures & Algorithms, Vol. 61, Issue 2, pages 298-308. https://doi.org/10.1002/rsa.21060
G. Ferreira Barros, B. Pasqualotto Cavalar, G. Oliveira Mota, O. Parczyk: Anti-Ramsey threshold of cycles. Discrete Applied Mathematics, Vol. 323, pages 228-235 (2022). https://doi.org/10.1016/j.dam.2021.10.021
O. Gebhard, M. Hahn-Klimroth, O. Parczyk, M. Penschuck, M. Rolvien, J. Scarlett, N. Tan: Near optimal sparsity-constrained group testing: improved bounds. IEEE Transactions on Information Theory, pages 3253 - 3280, (2022). 10.1109/TIT.2022.3141244
L. Gishboliner, R. Steiner, T. Szabó: Oriented cycles in digraphs of large outdegree. Combinatorica 42, pp. 1145–1187 (2022) https://doi.org/10.1007/s00493-021-4750-z
L. Gishboliner, R. Steiner, T. Szabó: Dichromatic number and forced subdivisions. Journal of Combinatorial Theory, Series B, Vol. 153, p. 1-30. (2022) https://doi.org/10.1016/j.jctb.2021.10.002
H. Hàn, J. Han, P. Morris: Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Random Structures & Algorithm, Vol. 61, Issue 1, pages 101-125, (2022) https://doi.org/10.1002/rsa.21052
A. Lamaison, A. Müyesser, M. Tait: On a colored Turán problem of Diwan and Mubayi. Discrete Mathematics, Vol. 345, Issue 10, 113003, (2022) https://doi.org/10.1016/j.disc.2022.113003
A. Liebenau, L. Mattos, W. Mendonça, J. Skokan: Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures & Algorithms, Vol. 62, Issue 4, p. 1035-1055. https://doi.org/10.1002/rsa.21106
N. Alon, M. Bucic, T. Kalvari, E. Kuperwasser, T. Szabo: List Ramsey numbers. Journal of Graph Theory, Vol. 96, Issue 1, pages 109-128, (2021). https://doi.org/10.1002/jgt.22610
M. Anastos, A. Frieze, P. Gao: Hamiltonicity of random graphs in the stochastic block model. SIAM Journal on Discrete Mathematics, Vol. 3, Issue 3, pp. 1854-1880, (2021). https://doi.org/10.1137/19M1296069
M. Anastos, A. Frieze: A scaling limit for the length of the longest cycle in a sparse random graph. Journal of Combinatorial Theory, Series B, Vol. 148, pp. 184-208, (2021). https://doi.org/10.1016/j.jctb.2021.01.001
M. Anastos, A. Frieze: Finding maximum matchings in random regular graphs in linear expected time. Random Structures & Algorithms, Vol. 58, Issue 3, pp. 390-429 (2021). https://doi.org/10.1002/rsa.20980
M. Anastos, A. Lamaison, R. Steiner, T. Szabó: Majority Colorings of Sparse Digraphs. The Electronical Journal of Combinatorics, Vol. 28, Issue 2, (2021). https://doi.org/10.37236/10067
A. Bishnoi, S. Das, P. Morris, T. Szabó: Ryser's Conjecture for t-intersecting hypergraphs. Journal of Combinatorial Theory, Series A, Volume 179, 105366. https://doi.org/10.1016/j.jcta.2020.105366 (2021)
J. Böttcher, O. Parczyk, A. Sgueglia, J. Skokan. Cycle factors in randomly perturbed graphs. Procedia Computer Science 195 (2021), 404–411. Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. https://doi.org/10.1016/j.procs.2021.11.049
J. Böttcher, O. Parczyk, A. Sgueglia, J. Skokan, J. The Square of a Hamilton Cycle in Randomly Perturbed Graphs. In: Nešetřil, J., Perarnau, G., Rué, J., Serra, O. (eds) Extended Abstracts EuroComb 2021. Trends in Mathematics(), vol 14. Birkhäuser, Cham. (2021) https://doi.org/10.1007/978-3-030-83823-2_103
P. Candela, C. Catala, R. Hancock, A. Kabela, D. Kral, A. Lamaison, L. Vena: Coloring graphs by translates in the circle. European Journal of Combinatorics, 103346, (2021) https://doi.org/10.1016/j.ejc.2021.103346
Y. Chang, J. Han, Y. Kohayakawa, P. Morris, G. Oliveira Mota: Factors in randomly perturbed hypergraphs. Random Structures & Algorithms, Vol. 60, Issue 2, pp. 153-165 (2021) https://doi.org/10.1002/rsa.21035
D. Clemens, F. Hamann, Y. Mogge, O. Parczyk: Positional games on randomly perturbed graphs. SIAM Journal on Discrete Mathematics 35 (2021), no 4, 2734–2748. https://doi.org/10.1137/20M1385044
S. Das, A. Pokrovskiy, B. Sudakov: Isomorphic Bisections of Cubic Graphs. Journal of Combinatorial Theory, Series B, Vol. 151, pp. 465-481, (2021) https://doi.org/10.1016/j.jctb.2021.08.003
S. Das, C. Knierim, P. Morris: Schur's Theorem for Randomly Perturbed Sets. In: Nešetřil J., Perarnau G., Rué J., Serra O. (eds) Extended Abstracts EuroComb 2021. Trends in Mathematics, vol 14. Birkhäuser, Cham. pp 384--389. (2021) https://doi.org/10.1007/978-3-030-83823-2_60
D. Fabian, J. Rué, C. Spiegel: On strong infinite Sidon and Bh sets and random sets of integers. Journal of Combinatorial Theory, Series A, Vol. 182, (2021). https://doi.org/10.1016/j.jcta.2021.105460
J. Han, P. Morris, A. Treglown:Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Structures and Algorithms, Vol. 58 (3), pp. 480-516. https://doi.org/10.1002/rsa.20981 (2021).
P. Morris: A tight condition for triangle factors in pseudorandom graphs. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematic, No. 20, pp. 899-918 (2021) . https://dl.acm.org/doi/10.5555/3458064.3458121
J. Han, Y. Kohaykawa, P. Morris and Y. Person: Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, Vol. 96, Issue 1, Pages 87-108, https://doi.org/10.1002/jgt.22576 (2021).
M. Anastos, D. Bal: A Ramsey property of random regular and k‐out graphs. Journal of Graph Theory, Vol. 93, Issue 3, pp. 363-371. https://doi.org/10.1002/jgt.22491 (2020)
M. Anastos, A. Frieze: Hamilton cycles in random graphs with minimum degree at least 3: an improved analysis. Random Structures and Algorithms, Vol. 57, Issue 4, Pages 865-878, https://doi.org/10.1002/rsa.20978 (2020)
A. Bishnoi, V. Pepe: Non-intersecting Ryser hypergraphs. SIAM J. Discrete Math., 34(1), 230–240. https://doi.org/10.1137/19M1241556 (2020)
A. Bishnoi, F. Ihringer, V. Pepe: A construction for clique-free pseudorandom graphs. Combinatorica 40, 307-314 https://doi.org/10.1007/s00493-020-4226-6 (2020)
M. Bowen, A. Lamaison, N. Alp Müyesser: Finding unavoidable colorful patterns in multicolored graphs. The Electronic Journal of Combinatorics, Vol. 27, Issue 4, P4.4 https://doi.org/10.37236/8184 (2020).
S. Boyadzhiyska, S. Das, T. Szabó: Enumerating extensions of mutually orthogonal Latin squares. Des. Codes Cryptogr. 88, 2187–2206 (2020). https://doi.org/10.1007/s10623-020-00771-6, (2020)
D. Conlon, S.Das, J. Lee, T. Mészáros: Ramsey games near the critical threshold. Random Structures and Algorithms, Vol. 57, Issue 4, Pages 940-957. https://doi.org/10.1002/rsa.20959 (2020)
J. Corsten, A. Mond, A. Pokrovskiy, C. Spiegel, T. Szabó: On the Odd Cycle Game and Connected Rules. European Journal of Combinatorics, Vol. 89, 103140, https://doi.org/10.1016/j.ejc.2020.103140 (2020)
S. Das, A. Treglown: Ramsey properties of randomly perturbed graphs: cliques and cycles. Combinatorics, Probability and Computing, 29(6), 830-867. https://doi.org/10.1017/S0963548320000231(2020)
S. Das, P. Morris, A. Treglown: Vertex Ramsey properties of randomly perturbed graphs. Random structures and Algorithms, Vol 57, Issue 4, pages 983-1006. https://doi.org/10.1002/rsa.20971 (2020)
F. S. Felsner, T. Mészáros, P. Micek: Boolean dimension and tree-width. Combinatorica 40, 655–677. https://doi.org/10.1007/s00493-020-4000-9 (2020).
H. Hàn, J. Han, P. Morris: Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Extended Abstract. SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Pages 702–717. https://dl.acm.org/doi/10.5555/3381089.3381132 (2020).
M. Krivelevich, T. Mészáros, P. Michaeli, C. Shikhelman: Greedy maximal independent sets via local limits. Proceedings of AofA 2020, LIPIcs Vol. 159, 20:1-19. DOI:10.4230/LIPIcs.AofA.2020.20 (2020)
C. Kusch, T. Mészáros: Shattering-extremal set systems from Sperner families. Discrete Applied Mathematics: Vol 276, Pages 92-101. https://doi.org/10.1016/j.dam.2019.07.016 (2020)
T. Mészáros: Standard monomials and extremal point sets. Discrete Mathematics, Vol. 343, Issue 4. https://doi.org/10.1016/j.disc.2019.111785 (2020)
T. Mészáros, P. Micek, W.T. Trotter, Boolean Dimension, Components and Blocks. Order Vol. 37, 287-298 (2020). https://doi.org/10.1007/s11083-019-09505-3
A. Abu-Khazneh, J. Barát, T. Szabo, A. Pokrovskiy: A family of extremal hypergraphs for Ryser's conjecture. Journal of Combinatorial Theory, Series A, Volume 161, Pages 164-177. (2019) https://doi.org/10.1016/j.jcta.2018.07.011
M. Anastos A. Frieze: How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? Journal of Graph Theory, Vol. 92, Issue 4 (2019). https://doi.org/10.1002/jgt.22461
M. Anastos, A. Frieze: Pattern Colored Hamilton Cycles in Random Graphs. SIAM J. Discrete Math., 33(1), 528–545 (2019). https://doi.org/10.1137/17M1149420
M. Anastos, P. Michaeli, S. Petti: Thresholds in random motif graphs. In Proc.: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Vol. 145, Pages 66:1--66:19 Doi: 10.4230/LIPIcs.APPROX-RANDOM.2019.66 (2019)
J. Balogh, S. Das, H. Liu, M. Sharifzadeh, T. Tran: Structure and Supersaturation for Intersecting Families. Submitted (2018). Electronic Journal of Combinatorics, Vol. 26, Issue 2, (2019). https://doi.org/10.37236/7683
I. N. Baoulina, A. Bishnoi and P. L. Clark. A generalization of the theorems of Chevalley-Warning and Ax-Katz via polynomial substitutions. Proc. Amer. Math. Soc. 147, 4107-4122. (2019). https://doi.org/10.1090/proc/14181
F. Barrera-Cruz, S. Felsner, T. Mészáros, P. Micek, H. Smith, L. Taylor, W.T. Trotter: Separating Tree-chromatic number from Path-chromatic Number: Journal of Combinatorial Theory, Series B, Vol 138, pp. 206-218. (2019). https://doi.org/10.1016/j.jctb.2019.02.003
T. Bayer, T. Mészáros, L. Rónyai, T. Szabó, Exploring projective norm graphs (extended abstract), Acta Mathematica Universitatis Comenianae, Vol. 88(3), 437-441 (2019)
S. Boyadzhiyska, G. Isaak, A. N Trenk: Interval orders with two interval lengths. Discrete Applied Mathematics, Volume 267, Pages 52-63. (2019). https://doi.org/10.1016/j.dam.2019.06.021
J. Corsten, L. DeBiasio, A. Lamaison, R. Lang: Upper density of monochromatic infinite paths. Advances in Combinatorics, 2019:4, 16pp. https://doi.org/10.19086/aic.10810
S. Das, R. Glebov, B. Sudakov, T. Tran: Colouring set families without monochromatic k-chains. J. of Combinatorical Theory, Series A, Vol. 168, pp. 84-119. (2019) https://doi.org/10.1016/j.jcta.2019.05.014
J. Han, Y. Kohaykawa, P. Morris and Y. Person: Clique factors in sparse pseudorandom graphs . European J. of Combinatorics, Vol 82. (2019) https://doi.org/10.1016/j.ejc.2019.102999
G. Kronenberg, C. Kusch, Lamaison, A. P. Micek, T. Tran: A Note on the Minimum Number of Edges in Hypergraphs with Property O. European J. of Combinatorics, Vol. 81, pp. 172-177. (2019) https://doi.org/10.1016/j.ejc.2019.05.002
Ch. Kusch, J. Rue, Ch. Spiegel, T. Szabó: On the optimality of the uniform random strategy. Random Structure and Algorithm. Vol. 55, Issue 2, Pages 371-401. (2019) https://doi.org/10.1002/rsa.20829
M. Aigner, G.M. Ziegler: Das Buch der Beweise. Überarbeitete und Erweiterte Neuauflage 2018. Springer Verlag.
M. Aigner, G.M. Ziegler: Proofs from THE BOOK. Revised and enlarged Edition 2018. Springer.
J. Balogh, T. Mészáros, A.Zs. Wagner: Two results about the hypercube. Discrete Applied Mathematics, Volume 247, Pages 322-326, (2018).
J. Bamberg, A. Bishnoi, G.F. Royle: On regular induced subgraphs of generalized polygons. Journal of Combinatorical Theory, Series a, Volume 158, Pages 254-275, (2018).
M. Bednarska-Bzdęga, M. Krivelevich, V. Mészároz, C. Requilé: Proper colouring Painter-Builder game. Discrete Mathematics 341, pp. 658-664, (2018)
A. Bishnoi, S. Mattheus, J. Schillewaert: Minimal multiple blocking sets. Electronic Journal of Combinatorics. Volume 25, Issue 4, #P4.66, (2018) .
D. Clemens, S. Das, T. Tran: Colourings without monochromatic disjoint pairs. European Journal of Combinatorics, Vol. 70, 99-124, (2018) .
S. Das, T. Mészáros, Small arrays of maximum coverage, Journal of Combinatorial Designs, Vol. 26(10), 487-504, (2018).
H. Hàn, V. Rödl, T. Szabó: Vertex Folkmann numbers and the minimum degree of minimal Ramsey graphs. SIAM Journal on Discrete Mathematics, Volume 32(2), Pages 826-838, (2018).
P. Haxell, L. Narins, T. Szabó: Extremal hypergraphs for Ryser's conjecture. Journal of Combinatorial Theory, Series A, 158, 492-547, (2018).
D. Clemens, A. Liebenau: A non-trivial upper bound on the threshold bias of the oriented-cycle game. Journal of Combinatorial Theory, Series B, (2017) Vol. 122, Pages 21-54.
J. Groschwitz, T. Szabó: Sharp thresholds for half-random games II. Graphs and Combinatorics 33 (2017), 387-401.
D. Hefetz, C. Kusch, L. Narins, A. Pokrovskiy, A. Sarid, C. Requilé: Strong Ramsey games: drawing on an infinite board. Journal of Combinatorial Theory, Series A 150C (2017) pp. 248-266.
T. Mészáros, L. Rónyai: Standard monomials and extremal vector systems (extended abstract) Electronic Notes in Discrete Mathematics, Vol. 61C, 855-861, 2017
M. Noy, J. Rué, C. Requilé: Enumeration of labelled 4-regular planar graphs(extended abstract). Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2017, Vienna, Austria, Electronic Journal of Discrete Mathematics 61 (2017) pp. 933-939.
A. Pokrovskiy, T. Szabó: Graphs without proper subgraphs of minimum degree 3 and short cycles. Combinatorica, (2017), Volume 37, Issue 3, pp. 495-519.
Clemens, D., Gebauer, H., & Liebenau, A. (2016). The Random Graph Intuition for the Tournament Game. Combinatorics, Probability and Computing, 25(1), 76-88.
A. A. Dobrynin, J. M. Oliva, V. R. Rosenfeld, J. J. Rué Perna: Pentagonal chains and annuli as models for designing nanostructures from cages.Journal of Mathematical Chemistry, (2016), Volume 54, Issue 3, pp 765–776 .
S. Das, W. Gan, B. Sudakov: The minimum number of disjoint pairs in set systems and related problems. Combinatorica 36 (6) (2016) 623-660.
S. Das, B. Sudakov, P. Vieira: Almost-Fisher families. J. Combinatorial Theory, Ser. A 138 (2016), 175-207.
S. Das, T. Tran: Removal and stability for Erdös-Ko-Rado. SIAM J. Discrete Math. 30 (2016), 1102-1114.
F. Fox, A. Grinshpun, A. Liebenau, Y. Person: On the minimum degree of minimal Ramsey Graphs for multiple colours. Journal fo Combinatorial Theory (Series B), 120 (2016), 64-82.
H. Gebauer, G. Tardos, T. Szabó: The Local Lemma is tight for SAT. Journal of the ACM 63 (5), (2016), No.43. (An extended abstract appeared in the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011), p. 664-674.)
J. Groschwitz, T. Szabó: Sharp threshold for half-randon games I. Random Structures and Algorithms, 49 (4), (2016), 766-794.
C. Grosu: A new lower bound for the Towers of Hanoi problem. The electronic journal of combinatorics 23(1) (2016), #P1.22 16.
C. Grosu: On the algebraic and topological structure of the set of Turán densities. Journal of Combinatorial Theory, (2016) Ser. B, Volume 118, Pages 137-185.
A. Pokrovskiy: Calculating Ramsey numbers by partitioning coloured graphs. Journal of Graph Theory (2016), Volume 84, Issue 4, Pages 477-500.
Z. Abel, R. Connelly, S. Eisenstat, R. Fulek, F. Moric, Y. Okamoto, T. Szabó, Cs. Töth: Free edge lengths in plane graphs. Discrete & Computational Geometry, 54 (1), 2015, 259-289. An extended abstract appeared in Proc. 30th Annual Symposium on Computational Geometry, SoCG 2014, Kyoto, ACM Press, 426-435.
M. Aigner, G. M. Ziegler: Das Buch der Beweise. Springer, 2015, 4. Auflage, 312 Seiten.
N. Alon, S. Das, R. Glebov, B. Sudakov: Comparable pairs in families of sets. J. Combinatorial Theory, Ser. B 115 (2015), 164-185.
J. Balogh, S. Das, M. Delcourt, H. Liu, M. Sharifzadeh: Intersecting families of discrete structures are typically trivial. Journal of Combinatorial Theory, 2015, Series A, 132, 224-245.
D. Clemens, J. Ehrenmüller, Y. Person, T. Tran: Keeping Avoider’s graph almost acyclic. The Electronic Journal of Combinatorics, 22(1), P1.60.
S. Das, W. Gan, B. Sudakov: Sperner’s Theorem and a problem of Erdös, Katona and Kleitman. Combinatorics, Probability and Computing 24 (2015), 585-608.
S. Das, B. Sudakov: Most probably intersecting hypergraphs. Electron. J. Comb. 22 (2015), P1.80.
S. Das, T. Tran: A simple removal lemma for large nearly-intersecting families. Electronic Notes in Discrete Mathematics,
(2015) Volume 49, Pages 93-99.
R. Glebov, A. Liebenau, T. Szabó: On the concentration of the domination number of the random graph. SIAM Journal of Discrete Mathematics, 29 (3), 2015, 1186-1206.
F. Grande, J. J. Rué Perna: Many 2-level polytopes from matroids. Discrete and Computational Geometry, December 2015, Volume 54, Issue 4, 954-979.
D. Mitsche, J. J. Rué Perna: On the limiting distribution of the metric dimension for random forests. European Journal of Combinatorics, 2015, 49, 68-89.
A. Pokrovskiy: A linear bound on the Manickam-Miklos-Singhi Conjecture. Journal of Combinatorial Theory (2015), Volume 133, Pages 280-306.
Z. Abel, R. Connelly, S. Eisenstat, R. Fulek, F. Moric, Y. Okamoto, T. Szabó, Cs. D. Tóth: Free Edge Lengths in Plane Graphs. Proc. 30th Annual Symposium on Computational Geometry (SoCG 2014, Kyoto), 2014, ACM Press, 426-435.
M. Aigner, G. M. Ziegler: Proofs from the book. Springer, 2014, 5. Auflage, 274 Seiten.
J. Cilleruelo, J. J. Rué Perna, P. Sarka, A. Zumalacárregui: The least common multiple of random sets of positive integers. Journal of Number Theory, 2014, 144, 92-104.
S. Das, W. Gan, B. Sudakov: Sperner’s Theorem and a Problem of Erdös, Katona and Kleitman. Combinatorics, Probability and Computing, 2014, 1-24.
A. Ferber, R. Glebov, M. Krivelevich, A. Naor: Biased Games On Random Boards. Random Structures & Algorithms, (2014) Vol. 46, Issue 4.
D. Gerbner, V. Meszaros, D. Palvolgyi, A. Pokrovskiy, G. Rote: Advantage in the Discrete Voronoi Game. Journal of Graph Algorithms and Applications, 2014, 18 (3), 439-457.
R. Glebov, M. Krivelevich, T. Szabó: On covering expander graphs with Hamilton cycles. Random Structures and Algorithms, 2014, 44, 183-200.
R. Glebov, B. Sudakov and T. Szabó: How many colors guarantee a rainbow matching? Electronic Journal of Combinatorics, 2014, 21 (1), P1.27.
R. Glebov, T. Szabó and G. Tardos: On conflict-free coloring of graphs. Combinatorics, Probality, and Computing, 2014, 23, 434-448.
A. Grinshpun, J. Fox, A. Liebenau, Y. Person, T. Szabó: What is Ramsey equivalent to a clique?. Journal of Combinatorial Theory, 2014, Series B, 109, 120-133.
C. Grosu: F_p is locally like C. Journal of the London Mathematical Society, 2014, 89 (3), 724-744.
C. Grosu, Y. Person, T. Szabo: On the rank of higher inclusion matrices. Journal of the London Mathematical Society, 2014, 90 (2), 333-349.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabó: Positional Games (Oberwolfach Seminars). Birkhäuser /Springer Basel, 2014, 156 p.
M. Noy, V. Ravelomanana, Juan José Rué Perna: On the probability of a random graph near the critical point. Proceedings of the American Mathematical Society, 2014, 143 (3), 925-936.
V. Pilaud, J. J. Rué Perna: Analytic combinatorics of chord and hyperchord diagrams with k crossings. Advances in Applied Mathematics, 2014, 57, 60-100.
A. Pokrovskiy: Edge growth in graph powers. Australasian Journal of Combinatorics, 2014, 58 (2), 347-357.
A. Pokrovskiy: Partitioning edge-coloured complete graphs into monochromatic cycles and paths.Journal of Combinatorial Theory, 2014, Series B, 106, 70-97.
J. J. Rué Perna, I. Sau, D. Thilikos: Dynamic programming for graphs on surfaces.ACM Transactions on Algorithms, 2014, 10 (2), 1-26.
T. Tran, G. M. Ziegler: Extremal edge polytopes. Electronic Journal of Combinatorics, 2014, 21 (2), P2.57.
M. Aigner: Markov´s Theorem and 100 Years of the Uniqueness Conjecture - A Mathematical Journey from Irrational Numbers to Perfect Matchings. Springer Verlag 2013, 257 pages.
J. Cilleruelo, A. Kumchev, F. Luca, J. Rué and I. Shparlinski: On the fractional parts of an/n. Bulletin of the London Mathematical Society, (2013) 45 (2): 249-256.
J. Cilleruelo, F. Luca, J. Rué and A. Zumalacárregui: On the sum of digits of some sequences of integers. Central European Journal of Mathematics, (2013), 11 (1): 188-195.
Clemens D., Ferber A., Glebov R., Hefetz D., Liebenau A.: Building spanning trees quickly in Maker-Breaker games. In: Nešetřil J., Pellegrini M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series,(2013) vol 16. Edizioni della Normale, Pisa
A. Ferber, R. Glebov, M. Krivelevich, H. Lui, C. Palmer, T. Valla, and M. Vizer: The biased odd cycle game. The Electronic Journal of Combinatorics (2013), Volume 20, Issue 2, #P9.
O. Giménez, M. Noy and J. Rué: Graph classes with given 3-connected components: asymptotic enumeration and random graphs. Random Structures and Algorithms, (2013) 42 (4): 438-479.
H. Lefmann, Y. Person: Exact results on the number of restricted edge colorings for some families of linear hypergraphs. Journal of Graph Theory, (2013) Volume 73, Issue 1, Pages 1-31.
J. Rué: On polynomial representation functions for multilinear forms. European Journal of Combinatorics, (2013), 34 (8): 1429-1435. Special Volume in Honor of Yahya Ould Hamidoune.
J. Rué, P. Sarka and A. Zumalacárregui: On the error term of the logarithm of the lcm of a quadratic sequence. Journal Théorie des nombres de Bordeaux, (2013) 25 (2): 457-470.
J. Rué, I. Sau and D. Thilikos: Asymptotic enumeration of non-crossing partitions on surfaces. Discrete Mathematics, (2013) 313 (5): 635-649.
M. Axenovich, Y. Person, S. Puzynina: A regularity lemma and twins in words. Journal of Combinatorial Theory, Series A 120 (4) (2012), 733-743.
D. Clemens, A. Ferber, M. Krivelevich, A. Liebenau: Fast Strategies In Maker–Breaker Games Played on Random Boards. Combinatorics, Probability and Computing, 21 (2012), 897-915.
D. Conlon, H. Hàn, Y. Person, M. Schacht: Weak quasi-randomness for uniform hypergraphs. Random Structures and Algorithms, 40 (1) (2012), 1==38.
D. Dellamonica Jr., P. Haxell, T. Łuczak, D. Mubayi, B. Nagle, Y. Person, V. Rödl, M. Schacht, J. Verstraete: On even-degree subgraphs of linear hypergraphs. Combinatorics, Probability and Computing, 21 (2012), 113==127.
D. Dellamonica Jr., P. Haxell, T. Łuczak, D. Mubayi, B. Nagle, Y. Person, V. Rödl, M. Schacht: Tree-minimal graphs are almost regular. Journal of Combinatorics, 3(1) (2012), 50-62.
R.Glebov: Bijective mappings preserving intersecting antichains for k-valued cubes. Discrete Mathematics, 312 (2012), 2023-2026.
R. Glebov, Y. Person and W. Weps: On extremal hypergraphs for Hamiltonian cycles. European Journal of Combinatorics, 33 (2012) 544-555.
C. Grosu, J. Hladký: The extremal function for partial bipartite tilings. European Journal of Combinatorics, 33 (2012), 807-815.
L. Gugelmann, Y. Person, A. Steger, H. Thomas: A randomized version of Ramsey's theorem. Random Structures and Algorithms, 41(1) (2012), 488-505.
L. Özkahya, Y. Person: Minimum H-decompositions of graphs: edge-critical case. Journal of Combinatorial Theory, Series B, 102 (2012), 715==725.
H. Gebauer, G. Tardos, T. Szabó: The Local Lemma is tight for SAT. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011), to appear.
L. Gugelmann, Y. Person, A. Steger and H. Thomas: A randomized version of Ramsey's theorem. Proceedings of EuroComb 11, Electronic Notes in Discrete Mathematics, 38 (2011) 431==436.
H. Hàn, Y. Person and M. Schacht: Note on forcing pairs. Proceedings of EuroComb 11, Electronic Notes in Discrete Mathematics, 38 (2011), 437==442.
D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: Global Maker-Breaker games on sparse graphs. European Journal of Combinatorics, to appear.
Y. Person and M. Schacht: An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discrete Mathematics and Theoretical Computer Science, 13(2) (2011), 1==18.
H. Lefmann, Y. Person and M. Schacht: A structural result for hypergraphs with many restricted edge colorings. Journal of Combinatorics, 1(3-4) (2010), 441==475.
T.Szabó, P. Zumstein, S. Zürcher: On the minimum degree of minimal Ramsey graphs. Journal of Graph Theory, 64 (2010), 150-164.
D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: Avoider-Enforcer: the rules of the game. Journal of Combinatorial Theory (Series A),117 (2010), 152-163.
H. Gebauer, T.Szabó: Asymptotic random graph intuition for the biased connectivity game. Random Structures and Algorithms , 35 (2009), 431-443.
D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Structures and Algorithms, 34 (2009) 112-122.
R. Aharoni, T.Szabó: Vizing's Conjecture for chordal graphs. Discrete Mathematics, 309 (2009), 1766-1768.
D. Hefetz, M. Krivelevich, T.Szabó: Hamilton cycles in highly connected and expanding graphs. Combinatorica ,29 (2009), 547-568.
R. Berke, T.Szabó: Deciding relaxed two-colorability === a hardness jump. Combinatorics, Probability, and Computing, 18 (2009), 53-81.
An extended abstract appeared in Proc. 14th Annual European Symposium on Algorithms (ESA), (2006) 124-135.
D. Hefetz, M. Krivelevich, M. Stojaković, T.Szabó: Fast winning strategies in Maker-Breaker games. Journal of Combinatorial Theory (Series B), 99 (2009), 39-47.