%0 Journal Article %1 baumann:2000 %A Baumann, Ulrike %D 2000 %J Math. Nachr. %K 2000 baumann publication %P 59-66 %T Fixed points of automorphisms of graphs with 1-factorizations. %V 210 %X The author considers sets of fixed points of finite, simple, undirected, connected graphs with 1-factorizations. It is shown that the maximum number of fixed points of 1-factorizations of graphs with $2n$ vertices cannot exceed $n$. The number is specifically determined for complete graphs $K_2n$ for $n> 2$. As a partial converse: given a prime $p$ there are graphs with $2p$ vertices whose 1-factorizations have automorphisms with $p$ fixed points.

@article{baumann:2000, abstract = {{The author considers sets of fixed points of finite, simple, undirected, connected graphs with 1-factorizations. It is shown that the maximum number of fixed points of 1-factorizations of graphs with $2n$ vertices cannot exceed $n$. The number is specifically determined for complete graphs $K_{2n}$ for $n> 2$. As a partial converse: given a prime $p$ there are graphs with $2p$ vertices whose 1-factorizations have automorphisms with $p$ fixed points.}}, added-at = {2010-02-26T12:40:37.000+0100}, author = {Baumann, Ulrike}, biburl = {https://www.bibsonomy.org/bibtex/2ba6681ce85d0c7e7e7ed425604bd1c26/algebradresden}, interhash = {33a007588963d537fe9f335cebfa72d9}, intrahash = {ba6681ce85d0c7e7e7ed425604bd1c26}, journal = {Math. Nachr. }, keywords = {2000 baumann publication}, pages = {59-66}, timestamp = {2010-02-26T12:40:37.000+0100}, title = {{Fixed points of automorphisms of graphs with 1-factorizations.}}, volume = 210, year = 2000 }