◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Peter J. Cameron

5 papers hereh-index 27 citations4 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author1
  • middle author1

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • math.CO3
  • math.GN1
  • math.GR1
same name
  • Peter J. Cameron — 7 papers, h 3
  • Peter J. Cameron — 5 papers, h 2
  • Peter J. Cameron — 1 paper, h 1
  • Peter J. Cameron — 1 paper, h 1
  • Peter J. Cameron — 1 paper, h 2
  • Peter J. Cameron — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20232026
most citedEPPA numbers of graphs

4 citations · 4 across the 3 of their papers we have counts for

collaborators

5 papers

math.GN2026

Graphs on Topological Spaces

Peter J. Cameron, Vinod Kumar P. B

Graphs defined on groups, such as power graphs, enhanced power graphs and commuting graphs, form a hierarchy under inclusion of edge sets. We develop an analogous theory for topolo…

math.GR2026

Synchronizing groups and weakly perfect graphs: a survey

Peter J. Cameron

The concept of synchronization has been transferred from finite automata, via transformation semigroups, to permutation groups: a permutation group G on a finite set Ω is said…

math.CO2025

Hall's marriage theorem

Peter J. Cameron

In 1935, Philip Hall published what is often referred to as ``Hall's marriage theorem'' in a short paper (P.~Hall, On Representatives of Subsets, \textit{J. Lond. Math. Soc.} (1) \…

math.CO2024

Simplicial complexes defined on groups

Peter J. Cameron

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes…

math.CO2023★ 4 cited

EPPA numbers of graphs

David Bradley-Williams, Peter J. Cameron, Jan Hubička +1

If G is a graph, A and B its induced subgraphs, and f:A→B an isomorphism, we say that f is a \emph{partial automorphism} of G. In 1992, Hrushovski proved that…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.