1 problem

0 votes0 replies0 views
Layered characterization for linear 3-graphs with vanishing codegree Turán density
A $3$ -graph is linear if any two distinct edges have at most one vertex in common. A $3$ -graph $F$ is layered if there is a function $f:V(F)\to\mathbb N$ satisfying the source's la…
Conjecturesolvedcodegree-turan-density hypergraph-turan-theory linear-3-graphsarXiv posted 2 days ago

Layered characterization for linear 3-graphs with vanishing codegree Turán density