1 citations · 1 across the 6 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Sparse pancyclic subgraphs of random graphs
Yahav Alon, Michael Krivelevich
It is known that the complete graph contains a pancyclic subgraph with edges, and that there is no pancyclic graph on vertices with fewer than…
math.CO2023
Two-round Ramsey games on random graphs
Yahav Alon, Patrick Morris, Wojciech Samotij
Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a singl…
math.CO2023★ 1 cited
The completion numbers of Hamiltonicity and pancyclicity in random graphs
Yahav Alon, Michael Anastos
Let denote the minimum number of edges whose addition to results in a Hamiltonian graph, and let denote the minimum number of edges whose addition to resu…