default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGholam Reza Omidi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Gholam Reza Omidi, Ghaffar Raeisi
:
Ramsey-Turán type results for matchings in edge colored graphs. Discret. Math. 347(3): 113785 (2024)- [j34]Gholam Reza Omidi, Ghaffar Raeisi:
Ramsey Numbers for Multiple Copies of Hypergraphs. Graphs Comb. 40(6): 133 (2024) - 2021
- [j33]G. R. Omidi:
A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles. Comb. Probab. Comput. 30(5): 654-669 (2021) - 2020
- [j32]Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer:
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34(1): 351-369 (2020)
2010 – 2019
- 2019
- [j31]Ramin Javadi, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy:
On the Size-Ramsey Number of Cycles. Comb. Probab. Comput. 28(6): 871-880 (2019) - [j30]Meysam Miralaei, G. R. Omidi, Maryam Shahsiah:
Size Ramsey numbers of stars versus cliques. J. Graph Theory 92(3): 275-286 (2019) - 2018
- [j29]G. R. Omidi, Ghaffar Raeisi, Zahra Rahimi:
Stars versus stripes Ramsey numbers. Eur. J. Comb. 67: 268-274 (2018) - [j28]Ramin Javadi, Afsaneh Khodadadpour, Gholam Reza Omidi:
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles. J. Graph Theory 88(3): 507-520 (2018) - [j27]Ramin Javadi, Gholam Reza Omidi:
On a Question of Erdös and Faudree on the Size Ramsey Numbers. SIAM J. Discret. Math. 32(3): 2217-2228 (2018) - 2017
- [j26]Saleh Ashkboos, Gholam Reza Omidi, Fateme Shafiei, Khosro Tajbakhsh:
Minimum Cuts of Distance-Regular Digraphs. Electron. J. Comb. 24(4): 4 (2017) - [j25]G. R. Omidi, Maryam Shahsiah:
Ramsey numbers of 4-uniform loose cycles. Discret. Appl. Math. 230: 112-120 (2017) - [j24]G. R. Omidi, Maryam Shahsiah:
Ramsey numbers of uniform loose paths and cycles. Discret. Math. 340(6): 1426-1434 (2017) - [j23]Leila Maherani, Gholam Reza Omidi:
Monochromatic Hamiltonian Berge-cycles in colored hypergraphs. Discret. Math. 340(8): 2043-2052 (2017) - [j22]G. R. Omidi, Maryam Shahsiah:
Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs. SIAM J. Discret. Math. 31(3): 1634-1669 (2017) - 2016
- [j21]H. Chuang, Hong-Jian Lai, G. R. Omidi, Niloufar Zakeri:
On group choosability of graphs, I. Ars Comb. 126: 195-209 (2016) - 2015
- [j20]Leila Maherani, G. R. Omidi, Ghaffar Raeisi, Maryam Shahsiah:
On Three-Color Ramsey Number of Paths. Graphs Comb. 31(6): 2299-2308 (2015) - 2014
- [j19]H. Chuang, Hong-Jian Lai, G. R. Omidi, K. Wang, Niloufar Zakeri:
On Group Choosability of Graphs, II. Graphs Comb. 30(3): 549-563 (2014) - [j18]G. R. Omidi, Maryam Shahsiah:
Ramsey numbers of 3-uniform loose paths and loose cycles. J. Comb. Theory A 121: 64-73 (2014) - 2013
- [j17]Leila Maherani, Gholam Reza Omidi, Ghaffar Raeisi, Maryam Shahsiah:
The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs. Electron. J. Comb. 20(1): 12 (2013) - [j16]Hong-Jian Lai, G. R. Omidi, Ghaffar Raeisi:
On Group Choosability of Total Graphs. Graphs Comb. 29(3): 585-597 (2013) - [j15]Edwin R. van Dam, G. R. Omidi:
Strongly walk-regular graphs. J. Comb. Theory A 120(4): 803-810 (2013) - 2012
- [j14]Amir Khamseh, G. R. Omidi:
A generalization of Ramsey theory for linear forests. Int. J. Comput. Math. 89(10): 1303-1310 (2012) - 2011
- [j13]Gholam Reza Omidi, Ghaffar Raeisi:
On Multicolor Ramsey Number of Paths Versus Cycles. Electron. J. Comb. 18(1) (2011) - [j12]Gholam Reza Omidi, Ghaffar Raeisi:
A note on the Ramsey number of stars - Complete graphs. Eur. J. Comb. 32(4): 598-599 (2011) - [j11]G. R. Omidi:
A Note on Group Choosability of Graphs with Girth at least 4. Graphs Comb. 27(2): 269-273 (2011) - 2010
- [j10]G. R. Omidi:
3-Designs and Large Sets of PSL(2, 2n) with Block Sizes 6. Ars Comb. 94 (2010) - [j9]G. R. Omidi:
The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2. Ars Comb. 94 (2010) - [j8]G. R. Omidi, Khosro Tajbakhsh:
The spectral characterization of graphs of index less than 2 with no Zn as a component. Ars Comb. 94 (2010) - [j7]Reinhard Laue, Gholam Reza Omidi, Behruz Tayfeh-Rezaie:
Large sets of t-designs from t-homogeneous groups. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j6]G. R. Omidi:
On graphs with largest Laplacian eigenvalue at most 4. Australas. J Comb. 44: 163-170 (2009) - [j5]G. R. Omidi:
On the Nullity of Bipartite Graphs. Graphs Comb. 25(1): 111-114 (2009) - [j4]G. R. Omidi:
On Integral Graphs with Few Cycles. Graphs Comb. 25(6): 841-849 (2009) - 2007
- [j3]G. R. Omidi, Mohammad Reza Pournaki, Behruz Tayfeh-Rezaie:
3-Designs with block size 6 from PSL(2, q) and their large sets. Discret. Math. 307(13): 1580-1588 (2007) - 2006
- [j2]Peter J. Cameron, G. R. Omidi, Behruz Tayfeh-Rezaie:
3-Designs from PGL(2, q). Electron. J. Comb. 13(1) (2006) - [j1]Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie:
3-Designs from PSL(2, q). Discret. Math. 306(23): 3063-3073 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
