Three-graphs without two triples whose symmetric difference is contained in a third
From MaRDI portal
Cites work
Cited in
(53)- Exact solution of some Turán-type problems
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- On complete subgraphs of r-chromatic graphs
- On the Turán number of triple systems
- Stability theorems for cancellative hypergraphs
- The feasible region of hypergraphs
- New short proofs to some stability theorems
- A unified approach to hypergraph stability
- Shattered matchings in intersecting hypergraphs
- On \(k\)-uniform random hypergraphs without generalized fans
- Asymptotic solution of a Turán-type problem
- Almost all triple systems with independent neighborhoods are semi-bipartite
- 4-books of three pages
- Stability theorems for some Kruskal-Katona type results
- 2-cancellative hypergraphs and codes
- The codegree threshold for 3-graphs with independent neighborhoods
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Turán number of generalized triangles
- On complete subgraphs of different orders
- Almost all triangle-free triple systems are tripartite
- On possible Turán densities
- Counting substructures. II: Hypergraphs
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Mantel's theorem for random hypergraphs
- A new generalization of the Erdős-Ko-Rado theorem
- On Turán numbers for disconnected hypergraphs
- On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Four-vertex traces of finite sets
- Restricted problems in extremal combinatorics
- Hypergraphs with independent neighborhoods
- Spectral Turán-type problems on cancellative hypergraphs
- Spectral Turán problems for nondegenerate hypergraphs
- When entropy meets Turán: new proofs and hypergraph Turán results
- Positive co-degree densities and jumps
- Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs
- Non-degenerate hypergraphs with exponentially many extremal constructions
- Positive co-degree density of hypergraphs
- Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
- Almost congruent triangles
- An improvement on triple systems without two types of configurations
- Positive codegree Andrásfai-Erdős-Sós theorem for the generalized triangle
- Triangle-free triple systems
- An exact result for 3-graphs
- Union-free hypergraphs and probability theory
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Asymptotic solution for a new class of forbidden r-graphs
- On set systems with a threshold property
- A new generalization of Mantel's theorem to \(k\)-graphs
- An exact Turán result for tripartite 3-graphs
- An exact Turán result for the generalized triangle
This page was built for publication: Three-graphs without two triples whose symmetric difference is contained in a third
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1211060)