R.S. Mishra

collaborators

2 papers

math.CO2026

On Ramsey goodness of $K_{2, n}$ versus cycles

Abisek Dewan, Sayan Gupta, Rajiv Mishra

A graph $G$ is called $H$ -good if $R (G, H) = (∣ G ∣ - 1) (I ¨ (H) - 1) + I ¨ (H)$ , where $I ¨ (H)$ denotes the size of the smallest color class in a $I ¨ (H)$ -coloring of $H$ . In Ramsey theory, it is…

math.CO2026

On Ramsey number of $K_{2, n}$ versus even cycles

Abisek Dewan, Sayan Gupta, Rajiv Mishra

For graphs $G$ and $H$ , the Ramsey number $R (G, H)$ is the smallest integer $N$ such that every graph $I^$ on $N$ vertices contains $G$ or its complement $I^$ contains $H$ …

On Ramsey goodness of K2,n​ versus cycles

On Ramsey number of K2,n​ versus even cycles

On Ramsey goodness of $K_{2, n}$ versus cycles

On Ramsey number of $K_{2, n}$ versus even cycles