Bjarne Schülke

collaborators

3 papers

math.CO2023

Simplicial Turán problems

David Conlon, Simón Piga, Bjarne Schülke

A simplicial complex $H$ consists of a pair of sets $(V, E)$ where $V$ is a set of vertices and $E \subseteq P (V)$ is a collection of subsets of $V$ closed under taking subs…

math.CO2020

On extremal problems concerning the traces of sets

Simón Piga, Bjarne Schülke

Given two non-negative integers $n$ and $s$ , define $m (n, s)$ to be the maximal number such that in every hypergraph $H$ on $n$ vertices and with at most $m (n, s)$ edges t…

math.CO2020

Covering $3$ -edge-coloured random graphs with monochromatic trees

Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota +1

We investigate the problem of determining how many monochromatic trees are necessary to cover the vertices of an edge-coloured random graph. More precisely, we show that for $p\gg…

Simplicial Turán problems

On extremal problems concerning the traces of sets

Covering 3-edge-coloured random graphs with monochromatic trees

Covering $3$ -edge-coloured random graphs with monochromatic trees