Files in this item
Tournaments and even graphs are equinumerous
Item metadata
dc.contributor.author | Royle, Gordon F. | |
dc.contributor.author | Praeger, Cheryl E. | |
dc.contributor.author | Glasby, S. P. | |
dc.contributor.author | Freedman, Saul Daniel | |
dc.contributor.author | Devillers, Alice | |
dc.date.accessioned | 2023-01-06T10:30:12Z | |
dc.date.available | 2023-01-06T10:30:12Z | |
dc.date.issued | 2023-03-01 | |
dc.identifier | 282343855 | |
dc.identifier | 6897f437-9ef6-45be-b5bc-46b49c61d7d5 | |
dc.identifier | 85145162319 | |
dc.identifier | 000906936800010 | |
dc.identifier.citation | Royle , G F , Praeger , C E , Glasby , S P , Freedman , S D & Devillers , A 2023 , ' Tournaments and even graphs are equinumerous ' , Journal of Algebraic Combinatorics , vol. 57 , pp. 515-524 . https://doi.org/10.1007/s10801-022-01197-0 | en |
dc.identifier.issn | 0925-9899 | |
dc.identifier.uri | https://hdl.handle.net/10023/26695 | |
dc.description | Funding: SDF was supported by a St Leonard’s International Doctoral Fees Scholarship and a School of Mathematics & Statistics PhD Funding Scholarship at the University of St Andrews. SPG was supported by the Australian Research Council Discovery Project DP190100450. | en |
dc.description.abstract | 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é Andersson) showed that the existence of such an automorphism is independent of the orientation and considered the question of counting pairwise non-isomorphic even graphs. Based on computational evidence, he made the rather surprising conjecture that the number of pairwise non-isomorphic even graphs on n vertices is equal to the number of pairwise non-isomorphic tournaments on n vertices. We prove this conjecture using a counting argument with several applications of the Cauchy–Frobenius theorem. | |
dc.format.extent | 10 | |
dc.format.extent | 315474 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Algebraic Combinatorics | en |
dc.subject | Tournaments | en |
dc.subject | Graph counting | en |
dc.subject | Graph enumeration | en |
dc.subject | Graph automorphisms | en |
dc.subject | Graph isomorphisms | en |
dc.subject | Cauchy-Frobenius theorem | en |
dc.subject | T-DAS | en |
dc.subject | MCC | en |
dc.title | Tournaments and even graphs are equinumerous | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | 10.1007/s10801-022-01197-0 | |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.