Tournaments and even graphs are equinumerous

DOI10.1007/s10801-022-01197-0OpenAlexW4313325394MaRDI QIDQ2701118

Saul D. Freedman, Stephen P. Glasby, Alice Devillers, Cheryl E. Praeger, Gordon F. Royle

Publication date: 27 April 2023

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.01947

zbMATH Keywords

tournamentsgraph enumerationgraph automorphismsgraph countinggraph isomorphismsCauchy-Frobenius theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• On the asymptotic distributions of subgraph counts in a random tournament
• The Number of Structures of Finite Relations

This page was built for publication: Tournaments and even graphs are equinumerous