Search Results - "Martins, Taisa"

Weak saturation numbers of complete bipartite graphs in the clique by Kronenberg, Gal, Martins, Taísa, Morrison, Natasha

“…The notion of weak saturation was introduced by Bollobás in 1968. Let F and H be graphs. A spanning subgraph G⊆F is weakly(F,H)-saturated if it contains no…”
Get full text

Short proofs on the structure of general partition, equistable and triangle graphs by Cerioli, Márcia R., Martins, Taísa

“…While presenting a combinatorial point of view to the class of equistable graphs, Miklavič and Milanič pointed out the inclusions among the classes of…”
Get full text

No additional tournaments are quasirandom-forcing by Hancock, Robert, Kabela, Adam, Král’, Daniel, Martins, Taísa, Parente, Roberto, Skerman, Fiona, Volec, Jan

“…A tournament H is quasirandom-forcing if the following holds for every sequence (Gn)n∈N of tournaments of growing orders: if the density of H in Gn converges…”
Get full text

A lower bound for set‐coloring Ramsey numbers by Aragão, Lucas, Collares, Maurício, Marciano, João Pedro, Martins, Taísa, Morris, Robert

“…The set‐coloring Ramsey number Rr,s(k)$$ {R}_{r,s}(k) $$ is defined to be the minimum n$$ n $$ such that if each edge of the complete graph Kn$$ {K}_n $$ is…”
Get full text

On the Anti-Ramsey Threshold for Non-Balanced Graphs by Araújo, Pedro, Martins, Taísa, Mattos, Letícia, Mendonça, Walner, Moreira, Luiz, Mota, Guilherme O.

“…For graphs $G,H$, we write $G \overset{\mathrm{rb}}{\longrightarrow} H $ if for every proper edge-coloring of $G$ there is a rainbow copy of $H$, i.e., a copy…”
Get full text

The size‐Ramsey number of powers of bounded degree trees by Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Mota, Guilherme Oliveira, Parczyk, Olaf

“…Given a positive integer s, the s‐colour size‐Ramsey number of a graph H is the smallest integer m such that there exists a graph G with m edges with the…”
Get full text

Association between sickle cell disease and the oral health condition of children and adolescents by Brandão, Carla Figueiredo, Oliveira, Viviane Maia Barreto, Santos, Ada Rocha Ramony Martins, da Silva, Taísa Midlej Martins, Vilella, Verônica Queiroz Cruz, Simas, Gleice Glenda Prata Pimentel, Carvalho, Laura Regina Santos, Carvalho, Raissa Aires Costa, Ladeia, Ana Marice Teixeira

“…Sickle cell disease (SCD) is the most prevalent monogenic hereditary pathology associated with the presence of hemoglobin SS in the world. It can affect…”
Get full text

No additional tournaments are quasirandom-forcing by Hancock, Robert, Kabela, Adam, Kral, Daniel, Martins, Taisa, Parente, Roberto, Skerman, Fiona, Volec, Jan

“…A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to…”
Get full text

Structural Results for General Partition, Equistable and Triangle graphs by Cerioli, Márcia R., Martins, Taísa L.

“…Miklavič and Milanič (2011) introduced the connections among the classes of equistable, general partition and triangle graphs. We present results concerning…”
Get full text

Finitely forcible graph limits are universal by Cooper, Jacob W, Kral, Daniel, Martins, Taisa L

“…The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are…”
Get full text

Theory of combinatorial limits and extremal combinatorics by Lopes Martins, Taísa

“…In the past years, techniques from different areas of mathematics have been successfully applied in extremal combinatorics problems. Examples include…”
Get full text

Weak saturation numbers of complete bipartite graphs in the clique by Kronenberg, Gal, Martins, Taísa, Morrison, Natasha

“…Journal of Combinatorial Theory, Series A. Volume 178, February 2021, 105357 The notion of weak saturation was introduced by Bollob\'as in 1968. Let $F$ and…”
Get full text

A lower bound for set-colouring Ramsey numbers by Aragão, Lucas, Collares, Maurício, Marciano, João Pedro, Martins, Taísa, Morris, Robert

“…The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$…”
Get full text

On the anti-Ramsey threshold for non-balanced graphs by Araújo, Pedro, Martins, Taísa, Mattos, Letícia, Mendonça, Walner, Moreira, Luiz, Mota, Guilherme O

“…For graphs $G$ and $H$, we write $G \overset{\mathrm{rb}}{\longrightarrow} H $ if any proper edge-coloring of $G$ contains a rainbow copy of $H$, i.e., a copy…”
Get full text

Decomposing graphs into edges and triangles by Král', Daniel, Lidický, Bernard, Martins, Taísa L, Pehova, Yanitsa

“…Combinator. Probab. Comp. 28 (2019) 465-472 We prove the following 30-year old conjecture of Gy\H{o}ri and Tuza: the edges of every $n$-vertex graph $G$ can be…”
Get full text

The step Sidorenko property and non-norming edge-transitive graphs by Král', Daniel, Martins, Taísa, Pach, Péter Pál, Wrochna, Marcin

“…Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs…”
Get full text

The size-Ramsey number of powers of bounded degree trees by Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Mota, Guilherme Oliveira, Parczyk, Olaf

“…Given a positive integer $s$, the $s$-colour size-Ramsey number of a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges…”
Get full text