Title: The Second Common Neighbourhood Conjecture

Speaker: JD Nir, Oakland University

Abstract: The Second Common Neighbourhood Conjecture is a question about the structure of shared neighbours in a graph. At first glance, it seems like a nice problem for a new researcher to study: it requires only a basic understanding of graph theory to state, examples are easy to understand, and one can quickly prove the conjecture holds in certain cases. However, the full conjecture remains stubbornly unsolved. If true, the conjecture immediately improves the best known bound in a problem in enumerative graph theory. We will introduce the conjecture, look at some of the cases where it is known to hold, and explore the related enumeration question.

---

Location: A1046

Date and Time: Wednesday, Feb. 11 at 04:10 PM - 05:10 PM (NST)

---