An exact result for 3-graphs
From MaRDI portal
Publication:793054
DOI10.1016/0012-365X(84)90058-XzbMath0538.05050OpenAlexW2029849517MaRDI QIDQ793054
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90058-x
Related Items
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, A problem of Erdős and Sós on 3-graphs, Symmetry in Turán sums of squares polynomials from flag algebras, Almost similar configurations, On set systems with a threshold property, Constructions and bounds for \((m,t)\)-splitting systems, Small cores in 3-uniform hypergraphs, Some Ramsey-Turán type results for hypergraphs, Exact solution of some Turán-type problems, Tournaments, 4-uniform hypergraphs, and an exact extremal result, Counting \(r\)-graphs without forbidden configurations, A hypergraph Turán theorem via Lagrangians of intersecting families, On the codegree density of complete 3-graphs and related problems, Extremal problems in uniformly dense hypergraphs, Lagrangian-perfect hypergraphs, The codegree threshold of \(K_4^-\), On Turán densities of small triple graphs, Uniform Turán density of cycles, Four-vertex traces of finite sets, Restricted problems in extremal combinatorics, Unavoidable order-size pairs in hypergraphs -- positive forcing density, Turán problems on non-uniform hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), Constructions of non-principal families in extremal hypergraph theory, Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, On the density of 2-colorable 3-graphs in which any four points span at most two edges, Mantel's theorem for random hypergraphs, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Computation of maximal projection constants, An irrational Turán density via hypergraph Lagrangian densities, Unnamed Item, On the Turán number of triple systems, The Turán density of triple systems is not principal, 3-uniform hypergraphs: modular decomposition and realization by tournaments
Cites Work
