Josefran de Oliveira Bastos

activity

20152017

most citedLoose Hamiltonian cycles forced by large

(k - 2)

-degree - approximate version

15 citations · 18 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2017★ 2 cited

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - sharp version

Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2

We prove for all $k \geq 4$ and $1 \leq ℓ < k /2$ the sharp minimum $(k - 2)$ -degree bound for a $k$ -uniform hypergraph $H$ on $n$ vertices to contain a Hamiltonian $ℓ$ -cycl…

math.CO2016★ 15 cited

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - approximate version

Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2

We prove that for all $k \geq 4$ and $1 \leq ℓ < k /2$ , every $k$ -uniform hypergraph $H$ on $n$ vertices with $δ_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+…

math.CO2015★ 1 cited

Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations

Josefran de Oliveira Bastos, Leonardo Nagami Coregliano

In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from Hästö (2003) and Warren (2004) to compute the permutation packin…

Loose Hamiltonian cycles forced by large (k−2)-degree - sharp version

Loose Hamiltonian cycles forced by large (k−2)-degree - approximate version

Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - sharp version

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - approximate version