The codegree Turán density of tight cycles minus one edge

DOI10.1017/S0963548323000196MaRDI QIDQ6632784

Simón Piga, Marcelo Tadeu Sales, Bjarne Schülke

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

hypergraphscodegree density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A problem of Erdős and Sós on 3-graphs
• The codegree threshold of \(K_4^-\)
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• On extremal problems of graphs and generalized graphs
• The co-degree density of the Fano plane
• Co-degree density of hypergraphs
• A note on codegree problems for hypergraphs
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• Paul turán, 1910–1976: His work in graph theory
• Hypergraph Turán Problems in l2-Norm

This page was built for publication: The codegree Turán density of tight cycles minus one edge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632784)