Tag Archives: MathOverflow

Automorphisms of groups

I set a question to my group theory class. It is quite easy until suddenly you find yourself falling off a cliff into deep water. Indeed, I don’t know the answer to the second part of this question. Show that … Continue reading

Posted in exposition, open problems | Tagged , , , | 4 Comments

MathOverflow

Today I put a toe into the pool that is MathOverflow for the first time. My question was: Which graphs have the property that the number of i-vertex induced subgraphs is at most i for some i<n/2 (where n is … Continue reading

Posted in doing mathematics, mathematics | Tagged , , , | 7 Comments