Three-graphs without two triples whose symmetric difference is contained in a third
From MaRDI portal
Cites work
Cited in
(42)- Stability theorems for some Kruskal-Katona type results
- Stability theorems for cancellative hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- The feasible region of hypergraphs
- Four-vertex traces of finite sets
- 4-books of three pages
- Spectral Turán-type problems on cancellative hypergraphs
- Shattered matchings in intersecting hypergraphs
- On set systems with a threshold property
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- An exact result for 3-graphs
- Asymptotic solution for a new class of forbidden r-graphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- A unified approach to hypergraph stability
- On possible Turán densities
- On \(k\)-uniform random hypergraphs without generalized fans
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- The codegree threshold for 3-graphs with independent neighborhoods
- Almost all triangle-free triple systems are tripartite
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Exact solution of some Turán-type problems
- An exact Turán result for tripartite 3-graphs
- New short proofs to some stability theorems
- Mantel's theorem for random hypergraphs
- Counting substructures. II: Hypergraphs
- Union-free hypergraphs and probability theory
- Asymptotic solution of a Turán-type problem
- Restricted problems in extremal combinatorics
- A new generalization of Mantel's theorem to \(k\)-graphs
- A new generalization of the Erdős-Ko-Rado theorem
- Hypergraphs with independent neighborhoods
- On complete subgraphs of r-chromatic graphs
- On the Turán number of triple systems
- Almost all triple systems with independent neighborhoods are semi-bipartite
- On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
- Turán number of generalized triangles
- An exact Turán result for the generalized triangle
- On Turán numbers for disconnected hypergraphs
- On complete subgraphs of different orders
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- 2-cancellative hypergraphs and codes
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)