◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. D. Freedman

14 papers hereh-index 444 citations17 works total

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

author position
  • sole author4
  • first author6
  • middle author4

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

fields
  • math.GR12
  • math.CO1
  • quant-ph1

identity via Semantic Scholar / OpenAlex

activity
20142026
most citedThe non-commuting, non-generating graph of a nilpotent group

9 citations · 29 across the 13 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2022★ 1 cited

Tournaments and Even Graphs are Equinumerous

Gordon F. Royle, Cheryl E. Praeger, S. P. Glasby +2

A graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges, and even otherwise. Pontus von Brömssen (né…

◍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.