<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Isfahan</PublisherName>
				<JournalTitle>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>8</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2019</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On problems concerning fixed-point-free permutations and on the polycirculant conjecture-a survey</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>15</FirstPage>
			<LastPage>40</LastPage>
			<ELocationID EIdType="pii">23166</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2018.112665.1585</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Majid</FirstName>
					<LastName>Arezoomand</LastName>
<Affiliation>University of Larestan</Affiliation>

</Author>
<Author>
					<FirstName>Alireza</FirstName>
					<LastName>Abdollahi</LastName>
<Affiliation>University of Isfahan</Affiliation>

</Author>
<Author>
					<FirstName>Pablo</FirstName>
					<LastName>Spiga</LastName>
<Affiliation>Dipartimento di Matematica e Applicazioni, University of Milano-Bicocca,</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2018</Year>
					<Month>08</Month>
					<Day>25</Day>
				</PubDate>
			</History>
		<Abstract>Fixed-point-free permutations‎, ‎also known as derangements‎, ‎have been studied for centuries‎. ‎In particular‎, ‎depending on their applications‎, ‎derangements of prime-power order and of prime order have always played a crucial role in a variety of different branches of mathematics‎: ‎from number theory to algebraic graph theory‎. ‎Substantial progress has been made on the study of derangements‎, ‎many long-standing open problems have been solved‎, ‎and many new research problems have arisen‎. ‎The results obtained and the methods developed in this area have also effectively been used to solve other problems regarding finite vertex-transitive graphs‎. ‎The methods used in this area range from deep group theory‎, ‎including the classification of the finite simple groups‎, ‎to combinatorial techniques‎. ‎This article is devoted to surveying results‎, ‎open problems and methods in this area‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎‎Derangements‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Polycirculant Conjecture‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Transitive group</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_23166_1e1c1fe183cadcd86904ba2543084f1f.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
