2010
[133] Gallai colorings of non-complete graphs, Discrete
Math. 310 (2010) 977 - 980 (with Gábor Sárközy)
[134] Monochromatic Hamiltonian 3-tight Berge cycles in
two-colored 4-uniform hypergraphs (with Sárközy and Szemerédi)
Journal of Graph Theory, 63 (2010) 288-299.
[135] Long monochromatic Berge cycles in colored 4-uniform
hypergraphs (with Sárközy and Szemerédi) Graphs and combinatorics,
26, (2010) 71-76.
[136] Rainbow and orthogonal paths in factorizations of
$K_n$ ,(with Mehdi Mhalla) Journal of Combinatorial Designs, 18 (3)
167-176.
[137] Ramsey-type results for Gallai colorings (with
Sárközy and Selkow and Sebő) Journal of graph theory, 64(3) (2009)
233-243.
[138] Monochromatic matchings in the shadow graph of
almost complete hypergraphs (with Sárközy and Szemerédi), Annals of
Combinatorics, 14, (2010) 245-249.
2011
[139] Large monochromatic components in edge colorings of graphs: A survey.
Book chapter in Ramsey Theory, yesterday, today and tomorrow, Ed: A. Soifer, pp. 77-96. Progress in mathematics 285, Birkhauser, 2011.
[140] Trees in greedy colorings of hypergraphs (with J. Lehel), Discrete Mathematics 311 (2011) 208-209. MR 2011:m 05215
[141] The 3-color Ramsey number of a 3-uniform Berge cycle (with Sárközy ), CPC 20, (2011) 53-71.
[142] Partitioning 3-colored complete graphs into three monochromatic cycles (with Ruszinkó, Szemerédi, Sárközy) The Electronic J. of combinatorics, 18( 2011) P53
[143 Long rainbow cycles in proper edge-colorings of complete graphs (with Ruszinkó, Sárközy and Schelp) Australasian J. of Combinatorics, 50 (2011) 45-53.
[144] Ramsey and Turán type theorems in geometric bipartite graphs, Annales Univ. Sci. Budapest Sect. math. 54 (2011) 47 - 56.
[145] On $(\delta \chi)$-bounded families of graphs (with M. Zaker), Electronic J. of Combinatorics, 18 (2011), P108
2012
[146] Star versus two stripes Ramsey numbers and a conjecture of Schelp (with G.N.Sárközy), Combinatorics, Probability and computing, 21 (2012) 179-186.
[147] New bounds on the Grundy number of products of graphs (with V. Campos, F. Havet, C. Linhares Sales, F. Maffray), Journal of Graph Theory
[148] Monochromatic of even cycles, Contributions to Discrete mathematics , { 7} (2011) 48-50. (with D. Pálvölgyi)
[149] Gallai colorings and domination in multicolored digraphs, Journal of Graph Theory {71} (2012) 278-292 (with G. Simonyi, A. Toth)
[150] The chromatic gap and its extremes, Journal of Combinatorial Theory B. {102} (2012), 1155-1178 (with A. Sebo, N. Trotignon)
[151] The Ramsey number of loose triangles and quadrangles in hypergraphs, The Electronic Journal of Combinatorics, {19} (2) (2012), P30 (with G. Raeisi)
[152] Partition of graphs and hypergraphs into monochromatic connected parts, The Electronic Journal of Combinatorics, (19) (3) (2012) P27 (with S. Fujita, M. Furuya, A. Toth)
2013
[153] Disconnected colors in generalized Gallai-colorings, Journal of Graph Theory {74} (2013) 104-114 (with S. Fujita, C. Magnant, A. Seress)
[154] Monochromatic path and cycle partitions in hypergraphs, The Electronic Journal of Combinatorics, {20} (1) (2013) P18 (with G.N.Sarkozy)
[155] 100 eve szuletett Erdos Pal, Kozepiskolai Matematikai es Fizikai Lapok, {63}(2013 majus) 258-261
[156] Complements of nearly perfect graphs, Journal of Combinatorics, {4} (3) (2013)299-310 (with Z.Li, R.Machado, A.Sebo, S. Thomasse, N. Trotignon)
[157] Gallai-colorings of triples and 2-factors of B_3, International Journal of Combinatorics, Volume 2013 article ID 929565, 6 pages (with L. Chua, C. Hossain)
[158] Coloring 2-intersecting hypergraphs, The Electronic Journal of Combinatorics, {20} (3) (2013) P37 (with L. Colucci)
2014
[159] Packing trees into n-chromatic graphs, Discussiones Mathematiciae Graph Theory {34} (2014) 199-201.
[160] Covering by few monochromatic pieces: a transition between two Ramsey problems, Graphs and Combinatorics, DOI 10.1007/s00373-013-1372-2 (with G.N.Sarkozy, S. Selkow)
[161] Noncrossing monochromatic subtrees and staircases in 0-1 matrices, Journal of Discrete Mathematics, volume 2014, article ID 731519, 5 pages (with S Cai, G. Grindstaff, W. Shull)
[162] Szamitastudomanyi elmenyeimbol, in: A szamitogep-tudomanyrol egyes szam elso szemelyben, TYPOTEX 2013, (szerk: Kornai Andras) 133-136.
[163] Multicolor Ramsey numbers for triple systems, Discrete Mathematics, {322} (2014)69-77 (with M. Axenovich, H. Liu, D. Mubayi)
[164] Domination in transitive colorings of tournaments, Journal of Combinatorial Theory B. {107} (2014) 1-11 (with D. Palvolgyi)
[165] List-coloring claw-free gr4aphs with small cique number, Graphs and Combinatorics, DOI 10.1007/s00373-012-1272-x (with L. Esperet, F. Maffray)
[166] Rainbow matchings and cycle-free partial transversals of Latin squares, Discrete Mathematics, {327} (2014) 96-102 (with G.N.Sarkozy)
[167] Large cross-free sets in Steiner triple systems, Journal of Combinatorial Designs, DOI 10.1002/jcd.21395
[168] A note on covering edge colored hypergraphs by monochromatic components, The Electronic Journal of Combinatorics, {21} (2) (2014) P2.33 (with S. Fujita,M Furuya, A. Toth)
[169] Monochromatic loose-cycle partitions in hypergraphs, The Electronic Journal of Combinatorics {21} (2) (2014) P2.36 (with G.N. Sarkozy)
[170] Partitioning edge colored graphs by monochromatic paths and cycles, Combinatorica, (ISSN: 0209-9683) (with J. Balogh, J. Barat, D. Gerbner, G.N. Sarkozy)
2015
[171] Ramsey Number of a Connected Triangle Matching, Journal of Graph Theory, 2016 (with G. N. Sarkozy)
2016 -
[172] Vertex covers by monochromatic pieces - a survey of results and problems , Discrete Mathematics, 339 (2016) 1970-1977.
[173] On 3-uniform hypergraphs without linear cycles, Journal of Combinatorics 7, (2016) 205-216 (with Ervin Gyori and Miklos Simonovits)
[174] Ramsey number of paths and connected matchings in Ore-type host graphs, Discrete Mathematics, 339 (2016) 1690-1698 (with J. Barat, J. Lehel, G.N. Sarkozy)
[175] Red-blue clique partitions and (1-1)-transversals, The Electronic Journal of Combinatorics, 23 (2016) P3.40 (with J. Lehel)
[176] Chromatic Ramsey number of acyclic hypergraphs, Discrete Mathematics, (2016) (with A. W. N. Riasanovsky and M. U. Sherman-Bennett)
[177] Cliques in C_4-free graphsof large minimum degree. Periodica Math. Hung. 74 (2017) 73-78 (with G.N.Sarkozy)
[178] Rainbow matchings in bipartite multigraphs, Periodica Math. Hung. 74 (2017) 108-111 (with J. Barat and G.N. Sarkozy)
[179]Induced colorful trees and paths in large chromatic graphs, The electronic J. of Combinatorics, 23(4) (2016) #p4.46 (with G.N.Sarkozy)
[180] Covering complete partite hypergraphs by monochromatic components, Discrete Math. 340 (2017) 27532761 (with Z. Kiraly)
[181]large monochromatic components in edge colored graphs with a minimum degree condition, Electronic Journal of Combinatorics , 24(3) (2017) #P3.54 (with G.N.Sarkozy)
[182] Ramsey theory on Steiner triples, Journal of Combinatorial designs, 26 (2018) 5-11 (with E. Granath, J. Hardee, T. Watson, X. Wu)
[183] Large sets of t-designs and a Ramsey type problem, Integers, 18 (2018) #A53
[184] Uniquely K_r^k-saturated hypergraphs, The Electronic Journal of Combinatorics, 25(4) (2018) #P4.35 (with S.G.Hartke and C. Viss)
[185] A note on Ramsey numbers for Berge-G hypergraphs, Discrete Math. 342 (2019) 1245-1252 (with M. Axenovich)
[186] The Turan number of Berge K_4 in triple systems, SIAM J. of Discrete Math. 33 (2019) 383-392.
[187] Partitioning the power set of [n] into C_k-free parts, The electronic J. of Combinatorics, 26(3), (2019) #P3.38 (with E. Blaisdell, B. Krueger, R.Wdowinsky)
[188] Monochromatic balanced components, matchings and paths in multicolored complete bipartite graphs, Journal of Combinatorics, 11(1) (2020) 35-45 (with L. DeBiasio, R.A.Krueger, M.Ruszinko, G.N.Sarkozy)
[189] Distribution of colors in Gallai colorings, European J. of Combinatorics, 86, (2020),103087 (with B. Patkos, D. Palvolgyi, M. Wales)
[190] Matchings with few colors in colored graphs and hypergraphs, Discrete Math. 343 (2020) 11831 (with G.N.Sarkozy)
[191] An extension of Mantel's theorem to k-graphs, American Math. Monthly, 127, (2020) 263-268, (with Z. Furedi)
[192] Perfect matchings in shadow colorings, Acta Math. Hung. 161(2) (2020) 397-400
[193] Ramsey numbers of path-matchings, covering designs and t-cores, J. of Combinatorial Theory B 146 (2021) 124-140 (with L. DeBiasio and G.N.Sarkozy
[194] Order plus size of tau-critical graphs, J. of Graph Theory 96(1) (2021) 85-86 (with J. Lehel)
[195] Turan and Ramsey numbers in linear triple systems, Discrete Math. 144 (2021) 112258 (with G.N.Sarkozy)
[196] Linear Turan numbers of acyclic triple systems, European J. of Combinatorics, 99 (2022) (with M. Ruszinko and G.N.Sarkozy)
[197] Turan numbers of special four-cycles in triple systems, Discrete Math. 345 (2022) 112667 (with Z. Furedi, and A. Sali)
[198] Covering 2-colored complete digraphs by monochromatic d-dominating digraphs, Journal of Graph Theory 100 (2022) 721-726 (with L. DeBiasiso)
[199] The linear Turan number of small triple systems, or why is the wicket interesting, Discrete Math. 345 (2022) 113025 (with G.N.Sarkozy)
[200] Crowns in linear 3-graphs of minimum degree 4, Electronic J. of Combinatorics 29 (2022) #P4.17 (with A. Carbonaro, W.Fletcher, J. Guo and R. Wang)
[201] Problems close to my heart, European J. of Combinatorics, 111 (2023) 103695
[202] Problems and results on 1-cross intersecting set pair systems, Combinatorics, Probability and Computing, 32 (2023) 691-702 (with Z. Furedi, Z. Kiraly)
[203] Proper edge colorings of cartesian products with rainbow C_4-s, Graphs and Combinatorics (2023) (with G.N.Sarkozy)
[204] Less strong chromatioc indices and the (7,4)-conjecture, Studia Math. Hung. 60 (2023) 109-122 (with G. N. Sarkozy)
[205] Monochromatic spannig trees and matchings in ordered complete graphs, Journal of Graph Theory 105 (4) (2024) 523-541 (with
