13 citations · 19 across the 15 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Saturation of Berge Hypergraphs
Sean English, Nathan Graber, Pamela Kirkpatrick +2
Given a graph , a hypergraph is a Berge- if it can be obtained by expanding each edge in to a hyperedge containing it. A hypergraph is Berge--saturated if does…
math.CO2017
Large monochromatic components and long monochromatic cycles in random hypergraphs
Patrick Bennett, Louis DeBiasio, Andrzej Dudek +1
We extend results of Gyárfás and Füredi on the largest monochromatic component in -colored complete -uniform hypergraphs to the setting of random hypergraphs. We also study l…
math.CO2017
On Rainbow Hamilton Cycles in Random Hypergraphs
Andrzej Dudek, Sean English, Alan Frieze
Let denote a randomly colored random hypergraph, constructed on the vertex set by taking each -tuple independently with probability , and then indepen…