174

Answers
votes newest views recent
39
Non-enumerative proof that there are many derangements?
22
Formal writing: numbers under 10
17
How many $p$-regular graphs with $n$ vertices are there?
16
Awfully sophisticated proof for simple facts
15
Examples of seemingly elementary problems that are hard to solve?
14
Regular graph of order 50, degree 7 and Automorphism group of order 288000. How to check if it is Cayley
12
Mathematical habits of thought and action which would be of use to non-mathematicians
11
Well-balanced covering of transpositions in $n$ elements
11
Titles composed entirely of math symbols
11
Combinatorial Interpretation
10
Level of detail on a Phd application
9
How many edge-disjoint cycles of length 3 are in the complete graph?
9
counting triangle free graphs
8
Solving a Rubik’s cube via a series of randomly selected (quarter-turn) Singmaster moves
8
Probability of a black path on a random chess board
8
Is it possible to decide in polynomial time if a poset is a subposet of another which is given ?
7
Resubmit paper to same journal
7
Combinatorial interpretation of the power of a series
7
How can I produce ‘canonical’ forms for rooted bipartite graphs?
7
Notable math from those without math PhDs
7
Inverting an asymptotic series
7
Counting spanning trees when blowing up vertices
7
Which finite group is not the automorphism group of some rooted finite trees
6
Generating function of a regular language
6
Growth constant limit for sum of products of two binomial coefficients
6
Comparing two measures on trees on $n$ vertices
6
Matrices. $XX^t=A$. $X=?$
6
Should I tell my current employer that I am applying to other jobs? Should I have at least one letter of recommendation come from someone in the faculty at my current job?
6
Random bipartite graphs
6
Counting the (additive) decompositions of a quadratic, symmetric, empty-diagonal and constant-line matrix into permutation matrices
1 2 3 4 5 6 next