Forbidding -extension of -- a counterexample of the Anstee-Sali conjecture
arXiv:2610.13987
Abstract
In this note we prove , thus providing a series of counterexamples of a 2005 conjecture of the first two authors. Here is the -extension of the 4-cycle, that is the -uniform hypergraph of four edges obtained by joining a set of vertices to each edge of . is the largest number of edges of a simple hypergraph on vertices without \emph{trace} (induced subhypergraph) .