3 papers
math.CO2024
A Conjecture on Rainbow Hamiltonian Cycle Decomposition
Ramin Javadi, Meysam Miralaei
Wu in 1999 conjectured that if is a subgraph of the complete graph with edges, then there is a Hamiltonian cycle decomposition of such that each edge…
math.CO2024
Bootstrap percolation on the Hamming graphs
Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie
The -edge bootstrap percolation on a graph is an activation process of the edges. The process starts with some initially activated edges and then, in each round, any inactive ed…
math.CO2023
Saturation numbers of bipartite graphs in random graphs
Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie +1
For a given graph , the -saturation number of a graph , denoted by , is the minimum number of edges in an edge-maximal -free subgraph of . In 2017, Kor…