On the codegree density of complete 3-graphs and related problems

zbMATH Open1295.05167arXiv1307.3395MaRDI QIDQ396955FDOQ396955

Authors: Victor Falgas-Ravry 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1307.3395

Recommendations

• The codegree threshold for 3-graphs with independent neighborhoods
• Codegree thresholds for covering 3-uniform hypergraphs
• Codegree Turán density of complete \(r\)-uniform hypergraphs

zbMATH Keywords

codegree densityextremal hypergraph theory

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Daisies and other Turán problems
• The CRC handbook of combinatorial designs
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• What we know and what we do not know about Turán numbers
• Title not available (Why is that?)
• An exact result for 3-graphs
• On the co-degree threshold for the Fano plane
• 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
• A hypergraph regularity method for generalized Turán problems
• Title not available (Why is that?)
• On Triple Systems with Independent Neighbourhoods

Cited In (12)

• Codegree problems for projective geometries
• On the codegree density of \(\mathrm{PG}_m(q)\)
• The codegree threshold for 3-graphs with independent neighborhoods
• Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
• Codegree thresholds for covering 3-uniform hypergraphs
• Independence number of hypergraphs under degree conditions
• A note on codegree problems for hypergraphs
• Extremal problems on the hypercube and the codegree Turán density of complete \(r\)-graphs
• On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
• Codegree Turán density of complete \(r\)-uniform hypergraphs
• Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
• Forcing large tight components in 3-graphs

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)