Triangle-free triple systems
From MaRDI portal
Cites work
- A new generalization of the Erdős-Ko-Rado theorem
- An exact result for 3-graphs
- An improvement on triple systems without two types of configurations
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Exact solution of some Turán-type problems
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- Method of quadratic forms in the Turan combinatorial problem
- On a theorem of Rademacher-Turán
- On generalized graphs
- On hypergraphs of girth five
- On Ramsey - Turan type theorems for hypergraphs
- On the decomposition threshold of a given graph
- Packing graphs: The packing problem solved
- Stability theorems for cancellative hypergraphs
- The Existence and Construction of Balanced Incomplete Block Designs
- The maximum number of edges in a minimal graph of diameter 2
- The Turán Number of Berge K₄ in Triple Systems
- Three-graphs without two triples whose symmetric difference is contained in a third
- Triangle-Free Hypergraphs
This page was built for publication: Triangle-free triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254898)