Norm hypergraphs

Abstract

We introduce a high uniformity generalization of the so-called (projective) norm graphs of Alon, Koll\'ar, R\'onyai, and Szab\'o, and use it to show that exd(n,Ks1,…,sd(d)) = (nd - 1s1… sd-1) holds for all integers s1,…,sd ≥ 2 such that sd ≥ ((d-1)(s1… sd-1-1))!+1. This improves upon a recent result of Ma, Yuan and Zhang, and thus settles (many) new cases of a conjecture of Mubayi.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…