Hypergraphs without non-trivial intersecting subgraphs
From MaRDI portal
Recommendations
- Hypergraphs of Bounded Disjointness
- Maximum hypergraphs without regular subgraphs
- On the degree, size, and chromatic index of a uniform hypergraph
- A hypergraph Turán theorem via Lagrangians of intersecting families
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
Cites work
- A homological approach to two problems on finite sets
- An Extremal Set-Intersection Theorem
- Counting designs
- Exact solution of some Turán-type problems
- Forbidding just one intersection
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 3453609 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- New results on simplex-clusters in set systems
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- On finite set-systems whose every intersection is a kernel of a star
- On set systems without a simplex-cluster and the junta method
- On Sperner families satisfying an additional condition
- Perfect matchings in uniform hypergraphs with large minimum degree
- Proof of a conjecture of Erdős on triangles in set-systems
- Set systems without a simplex or a cluster
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- The structure of large intersecting families
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
Cited in
(5)
This page was built for publication: Hypergraphs without non-trivial intersecting subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886354)
