Generalised Common Neighbour Conjecture for Saxl hypergraphs

Let GSym(Ω)G\leq \operatorname{Sym}(\Omega) be a finite permutation group with base size b(G)2b(G)\geq 2, and let H(G)\mathcal{H}(G) be its Saxl hypergraph; in the original graph formulation, use Σ(G)\Sigma(G). Generalised Common Neighbour Conjecture. For any distinct points α,βΩ\alpha,\beta\in\Omega, there exist a third point γΩ{α,β}\gamma\in\Omega\setminus\{\alpha,\beta\} and edges Eα,EβE_\alpha,E_\beta of H(G)\mathcal{H}(G) such that α,γEα\alpha,\gamma\in E_\alpha and β,γEβ\beta,\gamma\in E_\beta. This formulation generalises the common-neighbour property from Saxl graphs to Saxl hypergraphs; the supplied source gives no resolution.

Sources & referencesView supporting material

Primary source

Melissa Lee and Anthony Pisani, “The Saxl hypergraph of a permutation group”, arXiv:2505.13849 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.