BFP conjecture on nut graphs with two vertex and three edge orbits
BFP conjecture on nut graphs with two vertex and three edge orbits
Let be the order of a graph, and let a nut graph be a graph whose adjacency matrix is singular with one-dimensional null space spanned by an eigenvector having no zero entries. Vertex and edge orbits are the orbits of the automorphism group on the vertex set and edge set, respectively. BFP's conjecture. For every non-prime integer , there exists a nut graph of order with two vertex orbits and three edge orbits. The conjecture refines the known existence of nut graphs with two vertex orbits for every non-prime order by requiring exactly three edge orbits.
Sources & referencesView supporting material
Primary source
Ksenija Rozman and Primož Šparl, “On nut graphs with two vertex and three edge orbits”, arXiv:2508.17842 (2025).
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.