Similar Papers

Paper Title
Journal
Date
Author
All finite transitive graphs admit a self-adjoint free semigroupoid algebra
Adam Dor-On ... Christopher Linden
Proceedings of the Royal Society of Edinburgh: Section A Mathematics | VOL. 151
Adam Dor-On, et. al.Adam Dor-On ... Christopher Linden
30 Mar 2020
Percolation on finite graphs and isoperimetric inequalities
Noga Alon ... Alan Stacey
The Annals of Probability | VOL. 32
Noga Alon, et. al.Noga Alon ... Alan Stacey
01 Jul 2004
Finite transitive permutation groups and finite vertex-transitive graphs
Cheryl E. Praeger ... Cai Heng Li
-
Cheryl E. Praeger, et. al.Cheryl E. Praeger ... Cai Heng Li
01 Jan 1997
Accessibility in Transitive Graphs
Matthias Hamann
Combinatorica | VOL. 38
Matthias HamannMatthias Hamann
31 May 2017
View more papers

More From: Duke Mathematical Journal

Paper Title
Journal
Date
Author
Marked length spectrum rigidity for Anosov surfaces
Colin Guillarmou ... Gabriel P Paternain
Duke Mathematical Journal | VOL. -1
Colin Guillarmou, et. al.Colin Guillarmou ... Gabriel P Paternain
01 Jan 2025
Crepant resolutions of log-terminal singularities via Artin stacks
Matthew Satriano ... Jeremy Usatine
Duke Mathematical Journal | VOL. 173
Matthew Satriano, et. al.Matthew Satriano ... Jeremy Usatine
01 Dec 2024
The eighth moment of Dirichlet L-functions II
Vorrapan Chandee ... Maksym Radziwiłł
Duke Mathematical Journal | VOL. 173
Vorrapan Chandee, et. al.Vorrapan Chandee ... Maksym Radziwiłł
01 Dec 2024
The BGMN conjecture via stable pairs
Jenia Tevelev ... Sebastián Torres
Duke Mathematical Journal | VOL. 173
Jenia Tevelev, et. al.Jenia Tevelev ... Sebastián Torres
01 Dec 2024
View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.