Taísa Martins

According to our database, Taísa Martins authored at least 9 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A lower bound for set-coloring Ramsey numbers.

Lucas Aragão, Maurício Collares Neto, João Pedro Marciano, Taísa Martins, Robert Morris

Random Struct. Algorithms, March, 2024

On the Anti-Ramsey Threshold for Non-Balanced Graphs.

Pedro Araújo, Taísa Martins, Letícia Mattos, Walner Mendonça, Luiz Moreira, Guilherme Oliveira Mota

Electron. J. Comb., 2024

2023

No additional tournaments are quasirandom-forcing.

Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec

Eur. J. Comb., 2023

2021

Weak saturation numbers of complete bipartite graphs in the clique.

Gal Kronenberg, Taísa Martins, Natasha Morrison

J. Comb. Theory A, 2021

Short proofs on the structure of general partition, equistable and triangle graphs.

Márcia R. Cerioli, Taísa Martins

Discret. Appl. Math., 2021

Hitting times for arc-disjoint arborescences in random digraph processes.

Maurício Collares Neto, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente, Victor Souza

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2019

The step Sidorenko property and non-norming edge-transitive graphs.

Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna

J. Comb. Theory A, 2019

Decomposing Graphs into Edges and Triangles.

Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova

Comb. Probab. Comput., 2019

2015

Structural Results for General Partition, Equistable and Triangle graphs.

Márcia R. Cerioli, Taísa L. Martins

Electron. Notes Discret. Math., 2015