Sharply $k$-arc-transitive-digraphs: finite and infinite examples
M\"oller, R\"ognvaldur G., Poto\v{c}nik, Primo\v{z}, Norbert Seifter
Abstract
Open-access reader
M\"oller, R\"ognvaldur G., Poto\v{c}nik, Primo\v{z}, Norbert Seifter
Abstract
Open-access reader
A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinite examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinite examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth.
Key concepts: Transitive relation, Arc (geometry), Mathematics, Combinatorics, Polynomial, Construct (python library), Discrete mathematics, Computer science