2014

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.

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.