The higher-wise independence conjecture for projective norm graphs
The higher-wise independence conjecture for projective norm graphs
Let be a prime power, let be integers, and let denote the projective norm graph. A set of vertices has common neighbours if those vertices are all adjacent to each such common vertex.
Higher-wise independence conjecture. For any prime power and integers , all but sets of vertices in have common neighbours.
The claim extends the established asymptotic description of common neighbourhoods from triples to larger sets of vertices. The paper presents it as being supported by computer calculations; its general validity remains open.
Sources & referencesView supporting material
Primary source
Tomas Bayer, Tamás Mészáros, Lajos Rónyai and Tibor Szabó, “Exploring Projective Norm Graphs”, arXiv:1908.05190 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.