Prefer a chat interface with context about you and your work?
Antiregular graphs are universal for trees
A graph on n vertices is antiregular if its vertex degrees take on n ? 1 different values. For every n ? 2 there is a unique connected antiregular graph on n vertices. Call it An. (The unique disconnected antiregular graph on n vertices is Acn.) The main result of …