07.02.2014 Views

Slides (PDF)

Slides (PDF)

Slides (PDF)

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Candidate 3<br />

Conjecture<br />

Two trees are isomorphic if and only if they have the same degree<br />

spectrum at each level.<br />

If two trees have the same degree spectrum at each level, then they<br />

must automatically have the same numbers of levels, the same<br />

numbers of vertices at each level, and the same global degree<br />

spectrum!<br />

11 / 22

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!