User mojtaba jazaeri - MathOverflowmost recent 30 from http://mathoverflow.net2013-05-24T01:59:31Zhttp://mathoverflow.net/feeds/user/31179http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/122723/the-number-of-specific-structureThe number of specific structureMojtaba Jazaeri2013-02-23T14:11:30Z2013-02-24T06:19:41Z
<p>What is the number of families of $4t+1$ subsets of order $2t$ of the set ${1,2, \ldots ,p}$, where $p$ is a prime number which is equal to $4t+1$ and the order of intersection of each pair of the subsets is $t$ or $t-1$ and each subset has $t$-intersection with $2t$ subsets and $t-1$-intersection with the other $2t$ subsets?</p>
http://mathoverflow.net/questions/120857/the-number-of-non-isomorphic-strongly-regular-graphs-on-n-verticesThe number of non-isomorphic strongly regular graphs on n verticesMojtaba Jazaeri2013-02-05T13:46:03Z2013-02-05T14:32:15Z
<p>What is the number of strongly regular graphs on $n$ vertices? or at least how many non-isomorphic strongly regular graphs can exist?</p>
http://mathoverflow.net/questions/122723/the-number-of-specific-structureComment by Mojtaba JazaeriMojtaba Jazaeri2013-02-23T14:12:30Z2013-02-23T14:12:30ZThank you every one who answer to this question.http://mathoverflow.net/questions/120857/the-number-of-non-isomorphic-strongly-regular-graphs-on-n-vertices/120861#120861Comment by Mojtaba JazaeriMojtaba Jazaeri2013-02-09T18:52:37Z2013-02-09T18:52:37ZAs we know, every strongly regular graph over prime number of vertices is a conference graph and Paley graph is a conference graph and the following sentence due to Willem H. HAEMERS:
For v = 5, 9, 13 and 17, the Paley graph is the only one with the given parameters. If $v \geq 25$, other
graphs with the same parameters exist.
in the following paper:
Matrices for graphs, designs and codes
Why this sentence is true? if this sentence is true, then there are at least 2 non-isomorphic strongly regular graphs on prime number of vertices $p>25$.http://mathoverflow.net/questions/120857/the-number-of-non-isomorphic-strongly-regular-graphs-on-n-verticesComment by Mojtaba JazaeriMojtaba Jazaeri2013-02-05T17:54:39Z2013-02-05T17:54:39ZThank you very much Professor Chris Godsil and professor Aaron Meyerowitz.http://mathoverflow.net/questions/120857/the-number-of-non-isomorphic-strongly-regular-graphs-on-n-verticesComment by Mojtaba JazaeriMojtaba Jazaeri2013-02-05T13:54:15Z2013-02-05T13:54:15ZThank you for every one who answer to the question.