1,750 reputation
923
bio website
location
age 26
visits member for 4 years
seen 6 hours ago

If you have any good math exercises to share feel free to contribute them on http://exwiki.org


Sep
27
comment Length of longest cycle in this graph
You can use it through you web browser by registering on the link, otherwise it is relatively messed up for windows users.
Sep
27
comment Length of longest cycle in this graph
Sagemath is freely available to download or use through Sage cloud - cloud.sagemath.com In case you still do not wish to use it I can do it for you if you provide the edges of your graph in a .txr file
Sep
27
comment Length of longest cycle in this graph
The easiest way would be to enter the graph into Sage math and call longest_cycle()
Sep
24
awarded  Autobiographer
Sep
23
accepted counting occurence of subgraphs by counting their occurence in larger subgraphs
Sep
22
comment counting occurence of subgraphs by counting their occurence in larger subgraphs
Thanks. Could you also clarify why the first term in the product is just $d_I(G)?$
Sep
18
answered Chromatic Number and Average degree
Sep
10
awarded  Popular Question
Sep
10
revised Find all simple graphs with exactly one pair of vertices with the same degree.
edited body
Sep
10
answered Find all simple graphs with exactly one pair of vertices with the same degree.
Sep
10
asked counting occurence of subgraphs by counting their occurence in larger subgraphs
Sep
9
comment Why do the numbers not coincide?
It appears that the first sequence is the number of non-isomorphic graphs while you count labelled biconnected graphs?
Sep
8
comment Smallest non-hamiltonian k-connected graph
Here it is dropbox.com/s/xi66y2q2p70cbcs/example.png?dl=0
Sep
8
comment Smallest non-hamiltonian k-connected graph
Nevermind - I misunderstood the question. The comment about $k=3$ is still valid though.
Sep
8
comment Smallest non-hamiltonian k-connected graph
The smallest example for $k=3$ has 7 vertices.
Sep
8
comment Smallest non-hamiltonian k-connected graph
Notice that every Hamiltonian graph is $2$-connected so this question only makes sense for $k \ge 3$
Sep
4
revised example of graph such that deleting any edge couses lack of automorphism
added 6 characters in body
Sep
4
comment example of graph such that deleting any edge couses lack of automorphism
@bof Err I meant minimum degree $\ge$ 1
Sep
4
answered example of graph such that deleting any edge couses lack of automorphism
Sep
1
comment Graph with small average degree has two vertices of small degree
@Casteels I've seen the claim only in the linked document.