In my combinatorics seminar, we studied Moore graphs and discussed their rare extremal properties.

The research paper compared several crown graphs to determine which had the most resilient connectivity under random node failures.

The analyst presented three spider graphs to showcase performance metrics across departments.

Turán graphs illustrate how to maximize the number of edges in a graph while avoiding a complete subgraph of a specified size.

Researchers often compare different stream graphs to uncover recurring patterns in temporal networks.

Keller graphs reveal surprising symmetries when studied using spectral methods.

Coxeter graphs are indispensable tools for classifying reflection groups and understanding their geometric structures.

Tanner graphs are often used to visualize the structure of low-density parity-check codes.

In the workshop, researchers presented new algorithms for learning parameters of factor graphs and discussed scalability challenges.

Graduate students analyzed several utility graphs to find embeddings with the fewest edge crossings.