Jernej
Reputation
2,386
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
 Apr 10 revised Primality of the number of obtained by concatenating the n consecutive digits edited body Apr 10 asked Primality of the number of obtained by concatenating the n consecutive digits Apr 6 accepted Relating the number of partitions with ordered blocks Apr 3 accepted Obtaining a linear recurrence from differential equation Apr 1 revised Relating the number of partitions with ordered blocks edited body Apr 1 asked Obtaining a linear recurrence from differential equation Mar 31 comment Conjugacy classes of a subgroup of index 2. Thank you for your explanation. Somehow I downvoted your question and I cannot upvote unless you make an edit to this post. Hence could you make a minor change so that I can correct the vote? Mar 31 accepted Conjugacy classes of a subgroup of index 2. Mar 30 comment Conjugacy classes of a subgroup of index 2. Hm.. what exactly do you mean by "all orbits of H\cdot x$under conjugation with$H$? Mar 30 revised Relating the number of partitions with ordered blocks edited title Mar 30 asked Relating the number of partitions with ordered blocks Mar 30 comment Conjugacy classes of a subgroup of index 2. @GerryMyerson No I don't know that theorem. How can it be applied in this case? Mar 29 asked Conjugacy classes of a subgroup of index 2. Mar 24 answered How do I find the adjacency matrix for the nodes of an n-dimensional finite grid? Mar 10 answered How can I prove that the Wiener index of the hypercube graph is$k \cdot 4^{k-1}$? Mar 6 answered Number of edges in graphs having two disjoint cycles of equal length Mar 3 revised Number of edges in graphs having two disjoint cycles of equal length added 21 characters in body Mar 3 asked Number of edges in graphs having two disjoint cycles of equal length Mar 3 comment Show that if G is a simple graph with at least 4 vertices and 2n-3 edges, it must have two cycles of the same length. The claim that a simple graph of order$n$and at least$n-1$edges iimplies that$G$is connected is wrong. Mar 1 comment How do I find the lowest$k$for which a graph is$k\$-partite? There is no way to solve this problem in polynomial time. There are various ways to approach this problem depending on the real motivation of this question.