3.6k citations
- Perimeter InstituteCA123 papers
- Massachusetts Institute of TechnologyUS27 papers
- Durham UniversityGB24 papers
- Stanford UniversityUS24 papers
- California Institute of TechnologyUS23 papers
- Centre National de la Recherche ScientifiqueFR23 papers
- University of British ColumbiaCA21 papers
- University of TorontoCA20 papers
- Harvard UniversityUS17 papers
- McMaster UniversityCA17 papers
- Canadian Institute for Advanced ResearchCA16 papers
- University of California, BerkeleyUS16 papers
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013★ 8 cited
On the Longest Paths and the Diameter in Random Apollonian Networks
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao +4
We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at ran…
math.CO2013★ 3 cited
Non-Uniqueness of Minimal Superpermutations
Nathaniel Johnston
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n…
math.CO2013
Cores of Vertex Transitive Graphs
David Roberson
A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide th…