16 citations · 33 across the 19 of their papers we have counts for
5 papers · 1 filter
Shotgun assembly of random graphs
Tom Johnston, Gal Kronenberg, Alexander Roberts +1
In the graph shotgun assembly problem, we are given the balls of radius around each vertex of a graph and asked to reconstruct the graph. We study the shotgun assembly of the E…
Long running times for hypergraph bootstrap percolation
Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1
Consider the hypergraph bootstrap percolation process in which, given a fixed -uniform hypergraph and starting with a given hypergraph , at each step we add to al…
Decomposing cubic graphs into isomorphic linear forests
Gal Kronenberg, Shoham Letzter, Alexey Pokrovskiy +1
A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald c…
A multidimensional Ramsey Theorem
António Girão, Gal Kronenberg, Alex Scott
Ramsey theory is a central and active branch of combinatorics. Although Ramsey numbers for graphs have been extensively investigated since Ramsey's work in the 1930s, there is stil…
Independent sets in random subgraphs of the hypercube
Gal Kronenberg, Yinon Spinka
Let be the random subgraph of the -dimensional hypercube , where each edge is retained independently with probability . We study the asymptotic number of…