Leticia Mattos

activity

20192025

most citedOn product Schur triples in the integers

1 citations · 2 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

14 papers · 1 filter

math.CO2025

On the Prague dimension of sparse random graphs

Felix Joos, Letícia Mattos

The Prague dimension of a graph $G$ is defined as the minimum number of complete graphs whose direct product contains $G$ as an induced subgraph. Introduced in the 1970s by Nešetři…

math.CO2025

On almost Gallai colourings in complete graphs

Alexandr Grebennikov, Letícia Mattos, Tibor Szabó

For $t \in N$ , we say that a colouring of $E (K_{n})$ is $almost$ $t$ - $Gallai$ if no two rainbow $t$ -cliques share an edge. Motivated by a lemma of Berkowit…

math.CO2024

On the number of sets with small sumset

Dingyuan Liu, Letícia Mattos, Tibor Szabó

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$ -element subset $Y \subseteq G$ we show that if $m ≪ s^{2} / (lo g n)^{2}$ , the…

math.CO2024

Subgraphs of random graphs in hereditary families

Alexander Clifton, Hong Liu, Letícia Mattos +1

For a graph $G$ and a hereditary property $P$ , let $ex (G, P)$ denote the maximum number of edges of a subgraph of $G$ that belongs to $P$ . We pr…

math.CO2024

Clique packings in random graphs

Simon Griffiths, Letícia Mattos

We consider the question of how many edge-disjoint near-maximal cliques may be found in the dense Erdős-Rényi random graph $G (n, p)$ . Recently Acan and Kahn showed that the largest…

math.CO2024

On multicolor Turán numbers

József Balogh, Anita Liebenau, Letícia Mattos +1

We address a problem which is a generalization of Turán-type problems recently introduced by Imolay, Karl, Nagy and Váli. Let $F$ be a fixed graph and let $G$ be the union of $k$ e…

math.CO2023★ 1 cited

On product Schur triples in the integers

Letícia Mattos, Domenico Mergoni Cecchelli, Olaf Parczyk

Schur's theorem states that in any $k$ -colouring of the set of integers $[n]$ there is a monochromatic solution to $a + b = c$ , provided $n$ is sufficiently large. Abbott and Wang stud…

math.CO2023

Local central limit theorem for triangle counts in sparse random graphs

Pedro Araújo, Letícia Mattos

Let $X_{H}$ be the number of copies of a fixed graph $H$ in $G (n, p)$ . In 2016, Gilmer and Kopparty conjectured that a local central limit theorem should hold for $X_{H}$ as long as $H$ …

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★ 1 cited

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…

On the Prague dimension of sparse random graphs

On almost Gallai colourings in complete graphs

On the number of sets with small sumset

Subgraphs of random graphs in hereditary families

Clique packings in random graphs

On multicolor Turán numbers

On product Schur triples in the integers

Local central limit theorem for triangle counts in sparse random graphs

New Lower Bounds For Essential Covers Of The Cube

On the anti-Ramsey threshold for non-balanced graphs

Counting r-graphs without forbidden configurations

Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles

Long rainbow arithmetic progressions

On the singularity of random symmetric matrices

Counting $r$ -graphs without forbidden configurations