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 2018Show all

2 papers · 1 filter

math.CO2018

Semi-random graph process

Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3

We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on $n$ vertices. In every round of the process, one vert…

math.CO2018★ 1 cited

Goldberg's Conjecture is true for random multigraphs

Penny Haxell, Michael Krivelevich, Gal Kronenberg

In the 70s, Goldberg, and independently Seymour, conjectured that for any multigraph $G$ , the chromatic index $χ^{'} (G)$ satisfies $χ^{'} (G) \leq max {Δ (G) + 1, ⌈ ρ (G)⌉}$ , where…