Leticia Mattos

activity

20192022

collaborators

6 papers

math.CO2022

New Lower Bounds For Essential Covers Of The Cube

Igor Araujo, József Balogh, Letícia Mattos

An essential cover of the vertices of the $n$ -cube ${0, 1}^{n}$ by hyperplanes is a minimal covering where no hyperplane is redundant and every variable appears in the equation of a…

math.CO2022

On the anti-Ramsey threshold for non-balanced graphs

Pedro Araújo, Taísa Martins, Letícia Mattos +3

For graphs $G$ and $H$ , we write $G ⟶ rb H$ if any proper edge-coloring of $G$ contains a rainbow copy of $H$ , i.e., a copy where no color appear…

math.CO2021

Counting $r$ -graphs without forbidden configurations

József Balogh, Felix Christian Clemen, Letícia Mattos

One of the major problems in combinatorics is to determine the number of $r$ -uniform hypergraphs ( $r$ -graphs) on $n$ vertices which are free of certain forbidden structures. This p…

math.CO2020

Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles

Anita Liebenau, Letícia Mattos, Walner Mendonça +1

We say that $G \to (F, H)$ if, in every edge colouring $c : E (G) \to {1, 2}$ , we can find either a $1$ -coloured copy of $F$ or a $2$ -coloured copy of $H$ . The well-known Kohayakawa-…

math.CO2019

Long rainbow arithmetic progressions

József Balogh, William Linz, Letícia Mattos

Define $T_{k}$ as the minimal $t \in N$ for which there is a rainbow arithmetic progression of length $k$ in every equinumerous $t$ -coloring of $[t n]$ for all $n\in \mathbb{N…

math.CO2019

On the singularity of random symmetric matrices

Marcelo Campos, Letícia Mattos, Robert Morris +1

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in ${- 1, 1}$ is singular with probability $Θ (n^{2} 2^{- n})$ . In this paper we prove…