Whether any $(5,5,n)$-graph exists for $n \in \{43,44,45\}$ ($43 \leq R(5,5) \leq 46$) or outside the $656$ known $(5,5,42)$-graphs with $|\operatorname{Aut}(G)
Whether any $(5,5,42)$-graph exists beyond the $656$ known graphs ($328$ complementary pairs) and whether any $(5,5,43)$-graph exists ($43 \leq R(5,5) \leq 46$)
We study faithful cyclic order-$6$ ($C_6 = \langle g \rangle \cong C_3 \times C_2$) automorphisms of two-colored $(K_5, I_5)$-free graphs across Orders $N \in \
We resolve the faithful cyclic order-$9$ ($C_9 = \langle g \rangle$) automorphism question for two-colored $(K_5, I_5)$-free graphs across all four open vertex
We study $C_3$-equivariant neighbourhood and two-block gluing for $(5,5)$-free graphs at orders $N \in \{42,43\}$, where a $(K_4,I_5)$-free source $A$ on $r_A$