3 citations · 6 across the 3 of their papers we have counts for
4 papers
The (t-1)-chromatic Ramsey number for paths
Matija Bucić, Amir Khamseh
The following relaxation of the classical problem of determining Ramsey number of a fixed graph has first been proposed by Erdos, Hajnal and Rado over 50 years ago. Given a graph $…
Large stars with few colors
Amir Khamseh, Gholam Reza Omidi
A recent question in generalized Ramsey theory is that for fixed positive integers , at least how many vertices can be covered by the vertices of no more than monochro…
A generalization of Ramsey theory for stars and one matching
Amir Khamseh, Gholamreza Omidi
A recent question in generalized Ramsey theory is that for fixed positive integers , at least how many vertices can be covered by the vertices of no more than monochro…
On edge-group choosability of graphs
Amir Khamseh, Gholamreza Omidi
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability…