Showing math.COShow all
2 papers · 1 filter
math.CO2020
On extremal problems concerning the traces of sets
Simón Piga, Bjarne Schülke
Given two non-negative integers and , define to be the maximal number such that in every hypergraph on vertices and with at most edges t…
math.CO2020
Covering -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…