Reputation
2,061
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
Badges
10 26
Impact
~46k people reached

Nov
11
asked Equal parity of inversions and transpositions
Nov
11
comment If $|V(G)|=n$ and $e(G)>\frac{n}{4}\{1+\sqrt{4n-3}\}$ then $G$ contains 4-cycle
See this exwiki.org/mw/…
Nov
11
comment Minimizing a specific function over n variables
@WillNelson The sum of $p_i$'s has no such constraints. As for the asymmetry - the formula is indeed asymmetric in this way.
Nov
8
comment Proof for hamiltonian cycle in grids having even no. of nodes
Your question appear to be incomplete. A graph having an even number of nodes is not necessarily hamiltonian.
Nov
7
revised Minimizing a specific function over n variables
added 149 characters in body
Oct
30
awarded  Popular Question
Oct
20
asked Minimizing a specific function over n variables
Oct
15
answered Is there a database of cubic graphs on the web
Oct
9
comment Problem with an algorithm to $3$-colour the edges of cubic graphs
Have you read about snarks? These are precisely the cubic graphs that are not 3-edge-colorable and hence your problem is in a way equivalent to recognizing snarks. See en.wikipedia.org/wiki/Snark_%28graph_theory%29
Oct
8
comment spanning trees of an edge transitive graph
Here is a claim-proof version of this problem for the sake of clarity. exwiki.org/mw/…
Oct
8
comment spanning trees of an edge transitive graph
What do you mean by edge disjoint graph?
Oct
5
answered How to prove a graph asymmetric?
Oct
4
comment Approaching of area and perimeter of a regular polygon to that of a circle
BTW, this question is not about graph theory :)
Oct
3
comment How would I prove that the determinant reduced Laplacian of a graph is independent of the choice of $i$?
What is wrong with using Kirchhoff theorem then? You can quickly prove it using induction. See mathoverflow.net/questions/73385/…
Oct
3
answered How would I prove that the determinant reduced Laplacian of a graph is independent of the choice of $i$?
Sep
29
answered Basic Questions in Graph Theory
Sep
28
asked Computing the number of positive and negative eigenvalues
Sep
7
comment Graph chromatic number and graph homomorphism?
@user93620 Also take a look at the Mycielski construction en.wikipedia.org/wiki/Mycielskian
Sep
6
comment Diameter of a Connected Graph
For the second question see here exwiki.org/mw/…
Sep
6
comment Complete graph invariant
@ChrisGodsil In this case one just has to change in the above code : graphs.nauty_geng(str(n)): to graphs.cospectral_graphs(n)