Speaker: Michael Tait, Villanova University Title: Subgraphs of Pseudo-Random Graphs Abstract: Fix a graph \(F\). If I have a large pseudo-random graph can I always find \(F\) as a subgraph? Can I...
Speaker: James Davies, University of Cambridge, UK Title: Odd Distances in Colourings of the Plane. Abstract: We prove that every finite colouring of the plane contains a monochromatic pair of points...
Speaker: Bruce Sagan, Michigan State University Title: Chromatic Symmetric Functions, P-tableaux, and Jacobi-Trudi Determinants Abstract: For a graph G, let X(G) be Stanley’s chromatic symmetric...
Speaker: Gunjan Sharma, Ï㽶´«Ã½ Institute of Technology Title: Almost-Perfect Matchings in Trees Abstract: The Hosoya index of a graph is the total number of matchings in it and is a long-studied...
Speaker: Ruth Luo, University of South Carolina Title: Minimum Degree Conditions Ensuring the Existence of Long Cycles in Hypergraphs Abstract: Dirac proved that every \(n\)-vertex graph with minimum...
Speaker: Farid Aliniaeifard, University of British Columbia Title: Generalized Chromatic Functions Abstract: We define vertex-colourings for edge-coloured digraphs, which unify the theory of $P$...
Speaker: Kenneth Barrese, Brescia University Title: Factoring Rook Polynomials Abstract: Rook theory is a branch of mathematics which considers how many ways you can put rooks on a board so that no...
Speaker: Emily Barnard, DePaul University, Title: Dynamics and Topology of Lattice Posets Related to the Weak Order Abstract: In this talk, I will highlight results from three recent research projects...
Speaker: Dheer Desai, University of Wyoming Title: Spectral Turán Problems on Trees and Even Cycles Abstract: In this talk, we discuss some recent progress with the spectral analogue of a few Turán...
Speaker: John Engbers, University of Wisconsin-Milwaukee Title: Extremal Questions for Vertex Colorings of Graphs Abstract: For graphs \(G\) and \(H\), an \(H\)-coloring of \(G\) is a map from the...
