ON THE PARTIAL DIFFERENCE SETS IN CAYLEY DERANGEMENT GRAPHS
From MaRDI portal
Publication:3388606
DOI10.22190/FUMI1904651GzbMath1474.05179OpenAlexW3003220101MaRDI QIDQ3388606
Mina Rajabi-Parsa, Modjtaba Ghorbani
Publication date: 6 May 2021
Published in: Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22190/fumi1904651g
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Erdős-Ko-Rado-type theorem in Coxeter groups.
- On the maximum number of permutations with given maximal or minimal distance
- A survey of partial difference sets
- Erdős-Ko-Rado properties of some finite groups
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Generating a random permutation with random transpositions
- ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
- On the Erdos-Ko-Rado property of finite groups of order a product of three primes
- The Erd\H{o}s-Ko-Rado property for some permutation groups
- The bridge tournament problem and calibration designs for comparing pairs of objects
This page was built for publication: ON THE PARTIAL DIFFERENCE SETS IN CAYLEY DERANGEMENT GRAPHS
