<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Bounding s for vertex-primitive s-arc-transitive digraphs of alternating and symmetric groups</dc:title><dc:creator>Chen,	Junyan	(Avtor)
	</dc:creator><dc:creator>Chen,	Lei	(Avtor)
	</dc:creator><dc:creator>Giudici,	Michael	(Avtor)
	</dc:creator><dc:creator>Li,	Jing Jian	(Avtor)
	</dc:creator><dc:creator>Praeger,	Cheryl E.	(Avtor)
	</dc:creator><dc:creator>Xia,	Binzhou	(Avtor)
	</dc:creator><dc:subject>digraph</dc:subject><dc:subject>vertex-primitive</dc:subject><dc:subject>s-arc-transitive</dc:subject><dc:subject>alternating group</dc:subject><dc:subject>symmetric group</dc:subject><dc:description>Determining an upper bound on s for finite vertex-primitive s-arc-transitive digraphs has received considerable attention dating back to a question of Praeger in 1990. It was shown by Giudici and Xia that the smallest upper bound on s is attained for some digraph admitting an almost simple s-arc-transitive group. In this paper, based on the work of Pan, Wu and Yin, we prove that s&lt;=2 in the case where the group is an alternating or symmetric group.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-10-22 21:17:52</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22015</dc:identifier><dc:identifier>UDK: 51</dc:identifier><dc:identifier>eISSN: 1855-3974</dc:identifier><dc:identifier>DOI: https://doi.org/10.26493/1855-3974.3325.5e3</dc:identifier><dc:language>sl</dc:language></metadata>
