Paper Info
Title
On the Codegree Density of Complete 3-Graphs and Related Problems.
Abstract
Given a 3-graph F, its codegree threshold co-ex(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 triples but which contains no member of F as a subgraph. The limit [GRAPHICS] is known to exist and is called the codegree density of F. 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 >= 4, the codegree density of the complete 3-graph on s vertices K-s satisfies [GRAPHICS] We then 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 in finite families of 3-graphs.
Year
Venue
Keywords
2013
ELECTRONIC JOURNAL OF COMBINATORICS
Extremal hypergraph theory,codegree density
Field
DocType
Volume
Integer,Discrete mathematics,Graph,Combinatorics,Monad (category theory),Vertex (geometry),Upper and lower bounds,Infinity,Mathematics
Journal
20
Issue
ISSN
Citations 
4.0
1077-8926
2
PageRank 
References 
Authors
0.41
4
1
Name
Order
Citations
PageRank
Victor Falgas-Ravry1287.46