Gal Kronenberg

Orcid: 0000-0002-4495-1348

According to our database1, Gal Kronenberg authored at least 13 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Long running times for hypergraph bootstrap percolation.
Eur. J. Comb., January, 2024

2023
\(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs.
SIAM J. Discret. Math., June, 2023

2022
Shotgun assembly of random graphs.
CoRR, 2022

A multidimensional Ramsey Theorem.
CoRR, 2022

2021
Weak saturation numbers of complete bipartite graphs in the clique.
J. Comb. Theory, Ser. A, 2021

2020
Semi-random graph process.
Random Struct. Algorithms, 2020

2019
Goldberg's conjecture is true for random multigraphs.
J. Comb. Theory, Ser. B, 2019

A note on the minimum number of edges in hypergraphs with property O.
Eur. J. Comb., 2019

2018
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments.
Random Struct. Algorithms, 2018

Ramsey-nice families of graphs.
Eur. J. Comb., 2018

2017
Efficient Winning Strategies in Random-Turn Maker-Breaker Games.
J. Graph Theory, 2017

2015
Packing, Counting and Covering Hamilton cycles in random directed graphs.
Electron. Notes Discret. Math., 2015

Random-Player Maker-Breaker games.
Electron. J. Comb., 2015


  Loading...