2 citations · 4 across the 8 of their papers we have counts for
8 papers
On the size multipartite Ramsey numbers involving complete graphs
Leila Maherani, Maryam Shahsiah
Given two graphs H and G, the size multipartite Ramsey number mj (H, G) is the smallest natural number t such that an arbitrary coloring of the edges of Kjt, complete multipartite…
On the total versions of 1-2-3-conjecture for graphs and hypergraphs
Akbar Davoodi, Leila Maherani
In 2004, Karoński, Łuczak and Thomason proposed ---conjecture: For every nice graph there is an edge weighting function such that the in…
On Ramsey numbers of 3-uniform Berge cycles
Leila Maherani, Maryam Shahsiah
For an arbitrary graph , a hypergraph is called Berge- if there is a bijection such that for each , we have $…
Turan numbers of complete 3-uniform Berge-hypergraphs
L. Maherani, M. Shahsiah
Given a family of -graphs, the Turán number of for a given positive integer , denoted by , is the maximum number of edges of an…
Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
G. R. Omidi, L. Maherani
It has been conjectured that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Berge-cycle in every (r - 1)-coloring of the edges of the complete r-uni…
Around a conjecture of ErdH{o}s on graph Ramsey numbers
Leila Maherani, Gholamreza Omidi
For given graphs G1 and G2 the Ramsey number R(G1,G2), is the smallest positive integer n such that each blue-red edge coloring of the complete graph Kn contains a blue copy of G1…