Skip to main content
University of Oxford logo Home

Search form

  • Log in
  • Members
  • About Us
    • Contact Us
    • Travel & Maps
    • Our Building
    • Supporting Mathematics
    • Alumni
    • History
    • Art and Oxford Mathematics
    • News
    • Vacancies
    • Equality, Diversity & Inclusion
  • Study Here
    • Undergraduate Study
    • Postgraduate Study
    • Current Students
  • Research
    • Research Groups
    • Case studies
    • Faculty Books
  • Outreach
    • Posters
    • Oxford Mathematics Alphabet
    • Oxford Online Maths Club
    • It All Adds Up
    • Problem Solving Matters
    • PROMYS Europe
    • Oxfordshire Maths Masterclasses
    • Maths Week England
    • Outreach Information
    • Mailing List
  • People
    • Key Contacts
    • University People Search
    • People list
    • A Global Department
    • Research Fellowship Programmes
    • Professional Services Teams
  • Events
    • Conference Facilities
    • Public Lectures & Events
    • Departmental Seminars & Events
    • Special Lectures
    • Conferences
    • Summer Schools
    • Past Events
    • Alumni newsletters
    • Info for event organisers and attendees

Primary tabs

  • View(active tab)
  • Contact
Photo

Dr Gal Kronenberg

PhD (Tel Aviv University)
Status
Postdoctoral Research Associate

Marie Sklodowska-Curie Fellow

Royal Commission for the Exhibition of 1851 Research Fellow

 

kronenberg at maths dot ox dot ac dot uk

 

My arXiv

Google Scholar

Contact form
+44 1865 615313
Research groups
  • Combinatorics

Address
Mathematical Institute
University of Oxford
Andrew Wiles Building
Radcliffe Observatory Quarter
Woodstock Road
Oxford
OX2 6GG

Research interests

Random graphs, probabilistic combinatorics, extremal combinatorics.

Further details

Links:

My arXiv

Google Scholar

Some online lectures:

2-Universality of random graphs @ IAS

Slow bootstrap percolation @ Oxford

Independent sets in random subgraphs of the hypercube @ JIPS

Prizes, awards, and scholarships

The Royal Commission for the Exhibition of 1851 Postdoctoral Fellowship. 

Marie Sklodowska-Curie Postdoctoral Fellowship.

 

Major / recent publications

 

Shotgun assembly of random graphs
Tom Johnston, Gal Kronenberg, Alexander Roberts, Alex Scott
arxiv.org/abs/2211.14218

 

Decomposing cubic graphs into isomorphic linear forests
Gal Kronenberg, Shoham Letzter, Alexey Pokrovskiy, Liana Yepremyan
arxiv.org/abs/2210.11458

 

A multidimensional Ramsey Theorem
António Girão, Gal Kronenberg, Alex Scott
arxiv.org/abs/2210.09227

 

Long running times for hypergraph bootstrap percolation
Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg, Joanna Lada.
arxiv.org/abs/2209.02015

 

Independent sets in random subgraphs of the hypercube
Kronenberg Gal; Spinka Yinon.
arXiv:2201.06127

 

Turan-type problems for long cycles in random and pseudo-random graphs
Krivelevich, Michael; Gal Kronenberg; Adva Mond.
arXiv:1911.08539

 

The maximum length of K_r-Bootstrap Percolation
Balogh, József;  Kronenberg, Gal;  Pokrovskiy, Alexey; Szabó, Tibor.
Proceedings of the American Mathematical Society, to appear. arXiv:1907.04559

 

A Note on the Minimum Number of Edges in Hypergraphs with Property O
Gal Kronenberg, Christopher Kusch, Piotr Micek, and Tuan Tran.
European Journal of Combinatorics 81 (2019): 172-177.

 

Goldberg’s Conjecture is true for random multigraphs
Penny Haxell, Michael Krivelevich, and Gal Kronenberg.
Journal of Combinatorial Theory, Series B 138 (2019): 314-349.

 

Optimal Threshold for a Random Graph to be 2-Universal.
Asaf Ferber, Gal Kronenberg, and Kyle Luh.
Transactions of the American Mathematical Society 372 (2019): 4239-4262.

 

Ramsey-nice families of graphs 
Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, and Alon Naor.
European Journal of Combinatorics 72 (2018): 29-44.

 

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments 
Lior Gishboliner, Michael Krivelevich, and Gal Kronenberg.
Random Structures and Algorithms 52, no. 4 (2018): 545-559.

 

Packing, Counting and Covering Hamilton cycles in random directed graphs
Asaf Ferber, Gal Kronenberg, and Eoin Long.
Israel Journal of Mathematics 220, no. 1 (2017): 57-87

 

 

 

Oxford Mathematics Twitter
Oxford Mathematics Facebook
Oxford Mathematics Instangram
Oxford Mathematics Youtube

© Mathematical Institute
Website Accessibility Statement
Website Privacy Policy & Cookies Statement

Good practice scheme
Athena SWAN silver award
Stonewall workplace equality
sfy39587stp18