An exact result for 3-graphs
From MaRDI portal
Consider a hypergraph G with n vertices whose edge-set E is a subset of the set of all triplets of vertices of G. The authors give a complete description of all such hypergraphs with the property that every subset of four vertices of G contains either 0 or 2 triplets in G.
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
Cites work
- A new generalization of the Erdős-Ko-Rado theorem
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 3467166 (Why is no real title available?)
- On Ramsey - Turan type theorems for hypergraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
Cited in
(59)- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Some Ramsey-Turán type results for hypergraphs
- Exact solution of some Turán-type problems
- Symmetry in Turán sums of squares polynomials from flag algebras
- On the Turán number of triple systems
- The Turán density of triple systems is not principal
- On the Erdős-Hajnal problem for 3-graphs
- An irrational Turán density via hypergraph Lagrangian densities
- Counting \(r\)-graphs without forbidden configurations
- Extremal problems in uniformly dense hypergraphs
- Computation of maximal projection constants
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- Codegree thresholds for covering 3-uniform hypergraphs
- scientific article; zbMATH DE number 6390842 (Why is no real title available?)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- 3-uniform hypergraphs: modular decomposition and realization by tournaments
- Small cores in 3-uniform hypergraphs
- On the density of 2-colorable 3-graphs in which any four points span at most two edges
- A hypergraph Turán theorem via Lagrangians of intersecting families
- On the codegree density of complete 3-graphs and related problems
- scientific article; zbMATH DE number 1146232 (Why is no real title available?)
- scientific article; zbMATH DE number 1465768 (Why is no real title available?)
- Turán problems on non-uniform hypergraphs
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Almost similar configurations
- SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
- Mantel's theorem for random hypergraphs
- On multiplicative \(\lambda\)-approximations and some geometric applications
- scientific article; zbMATH DE number 7325727 (Why is no real title available?)
- Lagrangian-perfect hypergraphs
- 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
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- Hypergraphs with minimum positive uniform Turán density
- Turán numbers of r-graphs on r + 1 vertices
- Large cliques or cocliques in hypergraphs with forbidden order-size pairs
- Turán numbers and switching
- When entropy meets Turán: new proofs and hypergraph Turán results
- Is it easy to regularize a hypergraph with easy links?
- Positive co-degree densities and jumps
- Separating hypergraph Turán densities
- On Turán problems for suspension hypergraphs
- Applications of sparse hypergraph colorings
- Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs
- Positive co-degree density of hypergraphs
- Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
- Finite hypergraph families with rich extremal Turán constructions via mixing patterns
- An improvement on triple systems without two types of configurations
- Triangle-free triple systems
- Hypergraphs with many extremal configurations
- A jump in the codegree Turán densities of long tight cycles
- On set systems with a threshold property
- Constructions and bounds for \((m,t)\)-splitting systems
- On Turán densities of small triple graphs
- An \(S_ 3(3,5,21)\) using graphs
- Constructions of non-principal families in extremal hypergraph theory
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)
