Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On $3$-graphs with no four vertices spanning exactly two edges (2109.04944v2)

Published 10 Sep 2021 in math.CO

Abstract: Let $D_2$ denote the $3$-uniform hypergraph with $4$ vertices and $2$ edges. Answering a question of Alon and Shapira, we prove an induced removal lemma for $D_2$ having polynomial bounds. We also prove an Erd\H{o}s-Hajnal-type result: every induced $D_2$-free hypergraph on $n$ vertices contains a clique or an independent set of size $n{c}$ for some absolute constant $c > 0$. In the case of both problems, $D_2$ is the only nontrivial $k$-uniform hypergraph with $k\geq 3$ which admits a polynomial bound.

Summary

We haven't generated a summary for this paper yet.