Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Sims conjecture
open-in-new
<h2 id="references">References</h2> <ol> <li id="fn:1"><p>Sims, Charles C. (1967). "Graphs and finite permutation groups". Mathematische Zeitschrift. 95 (1): 76–86. doi:10.1007/BF01117534. S2CID 186227555. <a href="/wiki/Charles_Sims_(mathematician)" target="_blank">/wiki/Charles_Sims_(mathematician)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Pyber, László; Tracey, Gareth (2021). "Some simplifications in the proof of the Sims conjecture". arXiv:2102.06670 [math.GR]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Cameron, Peter J.; Praeger, Cheryl E.; Saxl, Jan; Seitz, Gary M. (1983). "On the Sims conjecture and distance transitive graphs". Bulletin of the London Mathematical Society. 15 (5): 499–506. doi:10.1112/blms/15.5.499. <a href="/wiki/Peter_Cameron_(mathematician)" target="_blank">/wiki/Peter_Cameron_(mathematician)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Cameron, Peter J. (1982). "There are only finitely many distance-transitive graphs of given valency greater than two". Combinatorica. 2 (1): 9–13. doi:10.1007/BF02579277. S2CID 6483108. <a href="/wiki/Peter_Cameron_(mathematician)" target="_blank">/wiki/Peter_Cameron_(mathematician)</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Isaacs, I. Martin (2011). Finite Group Theory. American Mathematical Society. ISBN 9780821843444. OCLC 935038216. <a href="9780821843444" target="_blank">9780821843444</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> </ol>