Open Problem Garden - Triangle free strongly regular graphs - Comments

Higman-Sims Graph (re: Triangle free strongly regular graphs)

Anonymous — Sat, 30 May 2020 22:31:46 +0200

In fact, all (seven) known primitive triangle-free strongly regular graphs are actual *subgraphs* of the Higman-Sims graph (which btw was first constructed by Dale Mesner). A Moore graph of degree 57 would of course break this mold.

Reply.. (re: Triangle free strongly regular graphs)

Anonymous — Thu, 23 Feb 2012 18:57:50 +0100

I hate math..Lol _________________________________________________________________________________________ toll free number

The complement of $2 K_n$ (re: Triangle free strongly regular graphs)

Anonymous — Wed, 08 Feb 2012 17:01:10 +0100

The complement of is triangle free srg with parameters . Probably this infinite case should be excluded from the conjecture.

If the number of the (re: Triangle free strongly regular graphs)

Anonymous — Thu, 21 Apr 2011 10:07:30 +0200

If the number of the vertices are even, we can determine regular triangle free graphs up to half the number of vertices of any degree. However, this does not hold true if the vertices numbers are odd. Some of the examples of even vertices graphs are Petersen graph (10 vertices), Heawood graph (14 vertices), Clebsch graph (16 vertices), Pappus graph (18 vertices) and odd vertices graph includes Schläfli graph (27 vertices), Perkel graph (57 vertices). 800 numbers

Triangle free strongly regular graphs

mdevos — Mon, 28 May 2007 16:49:01 +0200

Author(s):

Subject: Graph Theory » Algebraic G.T.

Problem Is there an eighth triangle free strongly regular graph?