COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Forcing quasirandomness in graphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact ibl10. A set of graphs is said to be forcing if their homomorphism densities determine whether a sequence of graphs is quasirandom. This definition was introduced in 1989 by Chung, Graham and Wilson, who showed that the set consisting of an edge and a cycle with four vertices is forcing. The existence of forcing sets of graphs with no forcing subsets will be discussed, as well as a new proof of the result of Shapira and Tyomkyn that sets of cliques are not forcing. This talk is part of the Combinatorics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsmp3foot C.U. Geographical SocietyOther talksBad men, good men, and loving women: Gender Constructions in the UK’s Online Action Counters Terrorism (ACT) Campaign Contributed talk: Rossby waves in the radiative interior Imagination and mathematics in economic modelling BSU Seminar: "The HealthGap study: Using linked administrative data to understand cardiovascular health of Indigenous people living in Victoria, Australia" Title: Saving Brains- Promises and challenges with stroke thrombectomy |