
We prove that every possible $k$-cycle can be embedded into $PG(n,q)$, for all $n\geq 3$ and $q$ a power of a prime.
6 pages
05C10, 51E15, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
05C10, 51E15, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
