Quasirandomness in additive groups and hypergraphs

Abstract: Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we explore this general concept as it applies to graphs, hypergraphs and additive groups, making clear their many connections to each other and showing how they can be used in order to better study these objects.

This page was built for publication: Quasirandomness in additive groups and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6371905)