M. Sales

activity

20202026

most citedOn quantitative aspects of a canonisation theorem for edge-orderings

5 citations · 5 across the 12 of their papers we have counts for

collaborators

Showing 2022Show all

6 papers · 1 filter

math.CO2022

The codegree Turán density of tight cycles minus one edge

Simón Piga, Marcelo Sales, Bjarne Schülke

Given $α > 0$ and an integer $ℓ \geq 5$ , we prove that every sufficiently large $3$ -uniform hypergraph $H$ on $n$ vertices in which every two vertices are contained in at least $α n$ …

math.CO2022

On the Ramsey number of daisies II

Marcelo Sales

A $(k + r)$ -uniform hypergraph $H$ on $(k + m)$ vertices is an $(r, m, k)$ -daisy if there exists a partition of the vertices $V (H) = K \cup M$ with $∣ K ∣ = k$ , $∣ M ∣ = m$ such that the set of edg…

math.CO2022

On the Ramsey number of daisies I

Pavel Pudlák, Vojtěch Rödl, Marcelo Sales

Daisies are a special type of hypergraphs introduced by Bollobás, Leader and Malvenuto. An $r$ -daisy determined by a pair of disjoint sets $K$ and $M$ is the $(r + ∣ K ∣)$ -uniform hype…

math.CO2022

A local version of Katona's intersection theorem

Marcelo Sales, Bjarne Schülke

Katona's intersection theorem states that every intersecting family $F \subseteq [n]^{(k)}$ satisfies $∣ \partial F ∣ \geq ∣ F ∣$ , where $\partial…

math.CO2022

Some results and problems on clique coverings of hypergraphs

Vojtech Rödl, Marcelo Sales

For a $k$ -uniform hypergraph $F$ we consider the parameter $Θ (F)$ , the minimum size of a clique cover of the of $F$ . We derive bounds on $Θ (F)$ for $F$ belonging to various classes…

math.CO2022

Independence number of hypergraphs under degree conditions

Vojtěch Rödl, Marcelo Sales, Yi Zhao

A well-known result of Ajtai et al. from 1982 states that every $k$ -graph $H$ on $n$ vertices, with girth at least five, and average degree $t^{k - 1}$ contains an independent set of…