Author:
Harcos Gergely,Soltész Daniel
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. R. C. Baker, G. Harman and J. Pintz: The difference between consecutive primes, II}, Proc. London Math. Soc. (3)83 (2001), 532–562.
2. P. Borg: Intersecting families of sets and permutations: a survey, Int. J. Math. Game Theory Algebra21 (2012), 543–559.
3. W. G. Brown: On graphs that do not contain a Thomsen graph, Canad. Math. Bull.9 (1966), 281–285.
4. L. S. Chandran, D. Rajendraprasad and N. Singh: On additive combinatorics of permutations of Zn, Discrete Math. Theor. Comput. Sci.16} (2014}), 35–
5. J. Cibulka: Maximum size of reverse-free sets of permutations, SIAM J. Discrete Math.27 (2013), 232–239.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献