Skip to main content

Quasi-random hypergraphs

Searching for OpenAIRE data...


Sharp bounds for decomposing graphs into edges and triangles

Author(s): Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Published in: Combinatorics, Probability and Computing, 30/2, 2021, Page(s) 271-287, ISSN 0963-5483
Publisher: Cambridge University Press
DOI: 10.1017/s0963548320000358

Compactness and finite forcibility of graphons

Author(s): Roman Glebov, Daniel Král', Jan Volec
Published in: Journal of the European Mathematical Society, 21/10, 2019, Page(s) 3199-3223, ISSN 1435-9855
Publisher: European Mathematical Society Publishing House
DOI: 10.4171/jems/901