An exact result for 3-graphs

DOI10.1016/0012-365X(84)90058-XzbMATH Open0538.05050OpenAlexW2029849517MaRDI QIDQ793054FDOQ793054

Authors: Zoltán Füredi, Peter Frankl 

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

Recommendations

• A structural result for 3-graphs
• An exact Turán result for tripartite 3-graphs
• Publication:4493343
• On the Erdős-Hajnal problem for 3-graphs
• A conjecture on 3-vertex-critical graphs
• scientific article; zbMATH DE number 3924792
• scientific article; zbMATH DE number 4200237
• On graphs with representation number 3
• scientific article; zbMATH DE number 2094794
• On \(3^*\)-connected graphs

zbMATH Keywords

3-graphsTuran's problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• On Ramsey - Turan type theorems for hypergraphs
• Title not available (Why is that?)
• A new generalization of the Erdős-Ko-Rado theorem
• Three-graphs without two triples whose symmetric difference is contained in a third
• Title not available (Why is that?)

Cited In (45)

• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• On the codegree density of complete 3-graphs and related problems
• Title not available (Why is that?)
• Four-vertex traces of finite sets
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On the density of 2-colorable 3-graphs in which any four points span at most two edges
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• On set systems with a threshold property
• Turán problems on non-uniform hypergraphs
• Hypergraphs with minimum positive uniform Turán density
• On multiplicative \(\lambda\)-approximations and some geometric applications
• Some Ramsey-Turán type results for hypergraphs
• An irrational Turán density via hypergraph Lagrangian densities
• Title not available (Why is that?)
• Exact solution of some Turán-type problems
• Codegree thresholds for covering 3-uniform hypergraphs
• On Turán densities of small triple graphs
• Mantel's theorem for random hypergraphs
• Turán numbers of \(r\)-graphs on \(r + 1\) vertices
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Title not available (Why is that?)
• Lagrangian-perfect hypergraphs
• A hypergraph Turán theorem via Lagrangians of intersecting families
• Title not available (Why is that?)
• Constructions and bounds for \((m,t)\)-splitting systems
• Restricted problems in extremal combinatorics
• Large cliques or cocliques in hypergraphs with forbidden order-size pairs
• Unavoidable order-size pairs in hypergraphs -- positive forcing density
• Small cores in 3-uniform hypergraphs
• Uniform Turán density of cycles
• Constructions of non-principal families in extremal hypergraph theory
• Computation of maximal projection constants
• SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
• Counting \(r\)-graphs without forbidden configurations
• An \(S_ 3(3,5,21)\) using graphs
• Turán numbers and switching
• The Turán density of triple systems is not principal
• Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
• Symmetry in Turán sums of squares polynomials from flag algebras
• On the Turán number of triple systems
• 3-uniform hypergraphs: modular decomposition and realization by tournaments
• Almost similar configurations
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• On the Erdős-Hajnal problem for 3-graphs
• Extremal problems in uniformly dense hypergraphs

This page was built for publication: An exact result for 3-graphs

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