Gholam Reza Omidi

Discret. Math., March, 2024

2021

A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

Ramsey Problems for Berge Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

2019

Size Ramsey numbers of stars versus cliques.

[BibT_eX]

[DOI]

Meysam Miralaei

J. Graph Theory, 2019

On the Size-Ramsey Number of Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

2018

On a Question of Erdös and Faudree on the Size Ramsey Numbers.

[BibT_eX]

[DOI]

Ramin Javadi

SIAM J. Discret. Math., 2018

Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles.

[BibT_eX]

[DOI]

Ramin Javadi

Afsaneh Khodadadpour

J. Graph Theory, 2018

Stars versus stripes Ramsey numbers.

[BibT_eX]

[DOI]

Zahra Rahimi

Eur. J. Comb., 2018

2017

Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Ramsey numbers of uniform loose paths and cycles.

[BibT_eX]

[DOI]

Discret. Math., 2017

Monochromatic Hamiltonian Berge-cycles in colored hypergraphs.

[BibT_eX]

[DOI]

Leila Maherani

Discret. Math., 2017

Ramsey numbers of 4-uniform loose cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Minimum Cuts of Distance-Regular Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

On group choosability of graphs, I.

[BibT_eX]

Ars Comb., 2016

2015

On Three-Color Ramsey Number of Paths.

[BibT_eX]

[DOI]

Graphs Comb., 2015

2014

Ramsey numbers of 3-uniform loose paths and loose cycles.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2014

On Group Choosability of Graphs, II.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

Strongly walk-regular graphs.

[BibT_eX]

[DOI]

Edwin R. van Dam

J. Comb. Theory, Ser. A, 2013

On Group Choosability of Total Graphs.

[BibT_eX]

[DOI]

Hong-Jian Lai

Graphs Comb., 2013

The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

A generalization of Ramsey theory for linear forests.

[BibT_eX]

[DOI]

Amir Khamseh

Int. J. Comput. Math., 2012

2011

A Note on Group Choosability of Graphs with Girth at least 4.

[BibT_eX]

[DOI]

Graphs Comb., 2011

A note on the Ramsey number of stars - Complete graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

On Multicolor Ramsey Number of Paths Versus Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

The spectral characterization of graphs of index less than 2 with no Z<sub>n</sub> as a component.

[BibT_eX]

Khosro Tajbakhsh

Ars Comb., 2010

The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2.

[BibT_eX]

Ars Comb., 2010

3-Designs and Large Sets of PSL(2, 2<sup>n</sup>) with Block Sizes 6.

[BibT_eX]

Ars Comb., 2010

Large sets of t-designs from t-homogeneous groups.

[BibT_eX]

Reinhard Laue

Behruz Tayfeh-Rezaie

Ars Comb., 2010

2009

On Integral Graphs with Few Cycles.

[BibT_eX]

[DOI]

Graphs Comb., 2009

On the Nullity of Bipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2009

On graphs with largest Laplacian eigenvalue at most 4.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

2007

3-Designs with block size 6 from PSL(2, q) and their large sets.

[BibT_eX]

[DOI]

Mohammad Reza Pournaki

Behruz Tayfeh-Rezaie

Discret. Math., 2007

2006

3-Designs from PSL(2, q).

[BibT_eX]

[DOI]

Discret. Math., 2006

3-Designs from PGL(2, q).

[BibT_eX]

[DOI]

Peter J. Cameron