MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For $n\geq 5$, let $\mathcal {P}_n$ be the set of all isomorphism classes of graphs with n vertices. Give this set the poset structure given by $G \le H$ if and only if $G$ is a subgraph of $H$.

Is it true that $\mathcal {P}_n$ has no nontrivial automorphisms?


This follows if one can recognize a graph from the set of isomorphism classes of its edge-deleted subgraphs. However, since recognizing a graph from the set of isomorphism classes of its edge-deleted subgraphs is stronger than edge reconstruction, I'm wondering if there is an alternative way of proving this.

share|cite|improve this question
Maybe it is useful to add that $\cal P_4$ has a nontrivial automorphism. Did you ckeck for higher values, e.g. using the tables from – domotorp Dec 31 '13 at 5:46
$\mathcal P_5$ can pretty easily be checked by hand. As for anything larger, I'm not sure. – Wade Hann-Caruthers Dec 31 '13 at 6:30
Of course there is in fact no need to check, as it anyhow follows from the set edge reconstruction conjecture but I could not find anything about for what values that has been checked. – domotorp Dec 31 '13 at 11:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.