Gal Kronenberg

activity

20142026

most citedWeak saturation numbers of complete bipartite graphs in the clique

16 citations · 33 across the 19 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017★ 1 cited

Ramsey-nice families of graphs

Ron Aharoni, Noga Alon, Michal Amir +5

For a finite family $F$ of fixed graphs let $R_{k} (F)$ be the smallest integer $n$ for which every $k$ -coloring of the edges of the complete graph $K_{n}$ yields a…

math.CO2017

A Note on the Minimum Number of Edges in Hypergraphs with Property O

Gal Kronenberg, Christopher Kusch, Ander Lamaison +2

An oriented $k$ -uniform hypergraph is said to have Property O if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. Recently…