(Hyper-)graph quasi-randomness

Yury Person
Humboldt-Universität
Computer Science

Quasi-randomness is a concept that studies deterministic objects that behave in many ways random objects do. It was first introduced by Thomason, and in their seminal paper Chung, Graham and Wilson considered several quasi-random graph properties that all turned out to be equivalent. I will discuss some of these properties and present their naive generalization to hypergraphs and its consequence for the graph quasi-randomness. Also some open problems will be presented. Joint work with David Conlon, Hiep Han and Mathias Schacht.