Learn More
One of the earliest results in Combinatorics is Mantel’s theorem from 1907 that the largest triangle-free graph on a given vertex set is complete bipartite. However, a seemingly similar question(More)
We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlós, Sarközy and Szemerédi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if(More)