On kaleidoscopic pseudo-randomness of finite Euclidean graphs
| dc.creator | Vinh, Le Anh | |
| dc.date | 2008-07-17 | |
| dc.date | 2008-08-03 | |
| dc.date.accessioned | 2026-07-07T09:54:06Z | |
| dc.date.available | 2026-07-07T09:54:06Z | |
| dc.description | In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations. | |
| dc.identifier | https://arxiv.org/abs/0807.2689 | |
| dc.identifier | http://arxiv.org/abs/0807.2689 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166192 | |
| dc.subject | Combinatorics | |
| dc.title | On kaleidoscopic pseudo-randomness of finite Euclidean graphs | |
| dc.type | text |