On forbidding graphs as traces of hypergraphs
Abstract
We say that a hypergraph H contains a graph H as a trace if there exists some set S⊂ V(H) such that H|S=\h S: h∈ E(H)\ contains a subhypergraph isomorphic to H. We study the largest number of hyperedges in 3-uniform hypergraphs avoiding some graph F as trace. In particular, we improve a bound given by Luo and Spiro in the case F=C4, and obtain exact bounds for large n when F is a book graph.
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.