3 citations · 3 across the 3 of their papers we have counts for
3 papers
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.CO2014★ 3 cited
On saturation games
Dan Hefetz, Michael Krivelevich, Alon Naor +1
A graph is said to be saturated with respect to a monotone increasing graph property , if but for…
math.CO2010
The number of F-matchings in almost every tree is a zero residue
Noga Alon, Simi Haber, Michael Krivelevich
For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for e…