FBD-graphs

Three different FBD-Graphs (fully blocked digraphs without oriented 1-, 2-, or 3-cycles), saved as an edgelist. `FBD_original.txt` contains to the full construction which is described in full-detail in the paper. `FBD_minimal_vertices.tex` is 6 vertices and 48 edges smaller, at the time of writing the smallest known FBD-graph w.r.t. number of vertices and edges. `FBD_minimal_α.txt` describes our smallest known graph w.r.t. max-α, i.e. the biggest number of 3-cliques a single edge participates in. In this case α=34. `verifier.py` contains self-explanatory python code to check a graph for FBD-properties. Please fetch graph data files manually if autofetching does not work.