{"id":71,"date":"2020-03-16T16:41:11","date_gmt":"2020-03-16T19:41:11","guid":{"rendered":"http:\/\/www.professores.uff.br\/tlmartins\/?page_id=71"},"modified":"2024-02-27T00:34:45","modified_gmt":"2024-02-27T03:34:45","slug":"publications","status":"publish","type":"page","link":"https:\/\/www.professores.uff.br\/tlmartins\/?page_id=71","title":{"rendered":"Publications"},"content":{"rendered":"\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Papers<\/strong><\/h3>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<ul style=\"line-height: 2.0\">\n\n<\/ul>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<hr class=\"wp-block-separator\" \/>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<ol reversed=\"\" style=\"line-height: 2.0\">\n<li>L. Arag\u00e3o, M. Collares, J. P. Marciano, T. Martins, R. Morris: <a href=\"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/rsa.21173\"><em>A lower bound for set-colouring Ramsey numbers<\/em><\/a>, Random Structures &amp; Algorithms <strong>64<\/strong> (2024), 157-169.<\/li>\n<li>P. Ara\u00fajo, T. Martins, L. Mattos, W. Mendon\u00e7a, L. Moreira, G. O. Mota: <a href=\"https:\/\/arxiv.org\/abs\/2201.05106\"><em>On the anti-Ramsey threshold for non-balanced graphs<\/em><\/a>, accepted to Electronic Journal of Combinatorics.<\/li>\n<li>R. Hancock, A. Kabela, D. Kr\u00e1\u013e, T. Martins, R. Parente, F. Skerman, J. Volec: <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0195669822001287\"><em>No additional tournaments are quasirandom-forcing<\/em><\/a>, European Journal of Combinatorics <strong>108<\/strong> (2023), article no. 103632, 10pp.<\/li>\n<li>G. Kronenberg, T. Martins, N. Morrison: <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0097316520301497\"><em>Weak saturation numbers of complete bipartite graphs in the clique<\/em><\/a>, Journal of Combinatorial Theory, Series A <strong>178<\/strong> (2021), 105357.<\/li>\n<li>S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendon\u00e7a, G. O. Mota, O. Parczyk: <a href=\"https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/jlms.12408\"><em>The size-Ramsey number of powers of bounded degree trees<\/em><\/a>, Journal of the London Mathematical Society <strong>103<\/strong> (2021), 1314-1332.<\/li>\n<li>M. R. Cerioli, T. Martins: <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0166218X20304273\" target=\"_blank\" rel=\"noreferrer noopener\"><em>Short proofs on the structure of General Partition, Equistable and Triangle graphs<\/em><\/a>, Discrete Applied Mathematics <strong>303<\/strong> (2021), 3-13.<\/li>\n<li>D. Kr\u00e1\u013e, B. Lidick\u00fd, T. L. Martins, Y. Pehova: <a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\/article\/decomposing-graphs-into-edges-and-triangles\/E4C8C50C5038046E38E191A4C791EAD7\" target=\"_blank\" rel=\"noreferrer noopener\"><em>Decomposing graphs into edges and triangles<\/em><\/a>, Combinatorics, Probability and Computing  <strong>28<\/strong> (2019), 465-472.<\/li>\n<li>D. Kr\u00e1\u013e, T. L. Martins, P. P. Pach, M. Wrochna: <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0097316518301328\"><em>Step Sidorenko property and non-norming edge-transitive graphs<\/em><\/a><em>,<\/em> Journal of Combinatorial Theory, Series A <strong>162 <\/strong>(2019), 34-54.<\/li>\n<li>J. W. Cooper, D. Kr\u00e1\u013e, T. L. Martins:  <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0001870818304134\"><em>Finitely forcible graph limits are universal<\/em><\/a>, Advances in Mathematics <strong>340 <\/strong>(2018), 819-854.<\/li>\n<\/ol>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Contributions in proceedings of mathematical conferences<\/strong><\/h3>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<ol reversed=\"\" style=\"line-height:2.0\">\n<li>P. Hu, B. Lidicky, T. Martins, S. Norin, J. Volec: <em>Large multipartite subgraphs in H-free graphs, <\/em>Proceedings of Eurocomb&#8217;21, CRM Series <strong>14<\/strong> (2021), 707-713.<\/li><li>M. Collares, Y. Kohayakawa, T. Martins, R. Parente, V. Souza: <em>Hitting times for arc-disjoint arborescences in random digraph processes, <\/em> Proceedings of LAGOS&#8217;21, Procedia Computer Science, <strong>195<\/strong> (2021), 376-384.<\/li><li>S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendon\u00e7a, G. O. Mota, O. Parczyk: <em>The size-Ramsey number of powers of bounded degree trees, <\/em>Proceedings of Eurocomb&#8217;19, Acta Mathematica Universitatis Comenianae <strong>88<\/strong>, 451-456.<\/li><li>M. R. Cerioli, T. L. Martins: <em>Structural Results for General Partition, Equistable and Triangle graphs<\/em>, Proceedings of Eurocomb&#8217;15, Electronic Notes in Discrete Mathematics <strong>49<\/strong> (2015), 713-718.<\/li><\/ol>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Books<\/strong><\/h3>\n\n\n\n<div style=\"height:20px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<ol reversed=\"\" style=\"line-height:2.0\">\n<li>F. Botler, M. Collares, T. Martins, W. Mendon\u00e7a, R.\nMorris e G. Mota.: <a href=\"https:\/\/impa.br\/wp-content\/uploads\/2022\/01\/33CBM02-eBook.pdf\">Combinat\u00f3ria<\/a>, Editora do IMPA (2021).<\/li><\/ol>\n","protected":false},"excerpt":{"rendered":"<p>Papers L. Arag\u00e3o, M. Collares, J. P. Marciano, T. Martins, R. Morris: A lower bound for set-colouring Ramsey numbers, Random Structures &amp; Algorithms 64 (2024), 157-169. P. Ara\u00fajo, T. Martins, L. Mattos, W. Mendon\u00e7a, L. Moreira, G. O. Mota: On the anti-Ramsey threshold for non-balanced graphs, accepted to Electronic Journal of Combinatorics. R. Hancock, A. [&hellip;]<\/p>\n","protected":false},"author":233,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"categories":[],"tags":[],"class_list":["post-71","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=\/wp\/v2\/pages\/71","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=\/wp\/v2\/users\/233"}],"replies":[{"embeddable":true,"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=71"}],"version-history":[{"count":35,"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=\/wp\/v2\/pages\/71\/revisions"}],"predecessor-version":[{"id":534,"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=\/wp\/v2\/pages\/71\/revisions\/534"}],"wp:attachment":[{"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=71"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=71"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.professores.uff.br\/tlmartins\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=71"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}