On the codegree density of complete 3-graphs and related problems
From MaRDI portal
Abstract: Given a family of 3-graphs F its codegree threshold coex(n, F) is the largest number d=d(n) such that there exists an n-vertex 3-graph in which every pair of vertices is contained in at least d 3-edges but which contains no member of F as a subgraph. The codegree density gamma(F) is the limit of coex(n,F)/(n-2) as n tends to infinity. In this paper we generalise a construction of Czygrinow and Nagle to bound below the codegree density of complete 3-graphs: for all integers s>3, the codegree density of the complete 3-graph on s vertices K_s satisfies gamma(K_s)geq 1-1/(s-2). We also provide constructions based on Steiner triple systems which show that if this lower bound is sharp, then we do not have stability in general. In addition we prove bounds on the codegree density for two other infinite families of 3-graphs.
Recommendations
Cites work
- A hypergraph regularity method for generalized Turán problems
- A note on codegree problems for hypergraphs
- An exact result for 3-graphs
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Co-degree density of hypergraphs
- Daisies and other Turán problems
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 1439495 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On the co-degree threshold for the Fano plane
- On Triple Systems with Independent Neighbourhoods
- The co-degree density of the Fano plane
- The codegree threshold for 3-graphs with independent neighborhoods
- The CRC handbook of combinatorial designs
- What we know and what we do not know about Turán numbers
Cited in
(12)- Forcing large tight components in 3-graphs
- Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
- Codegree problems for projective geometries
- A note on codegree problems for hypergraphs
- Codegree thresholds for covering 3-uniform hypergraphs
- The codegree threshold for 3-graphs with independent neighborhoods
- Extremal problems on the hypercube and the codegree Turán density of complete r-graphs
- Codegree Turán density of complete r-uniform hypergraphs
- On the codegree density of \(\mathrm{PG}_m(q)\)
- Independence number of hypergraphs under degree conditions
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
This page was built for publication: On the codegree density of complete 3-graphs and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396955)
