Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

Let 𝒟 be a non-trivial simple t-design. For 1 ≤ 𝑠 ≤ 𝑡, we generalize the concept of the incidence graph of 𝒟 and construct a new bipartite regular graph Γ. We obtain that the edge-transitivity of ...

It might not be as bright and shiny as some of the other topics that we've seen here, but there's no denying that the work of Julian Shun and his team is going to be applicable to a lot of the ...