Set Systems with No Singleton Intersection
From MaRDI portal
Recommendations
Cited in
(22)- On set systems with restricted intersections modulo p and p-ary t-designs
- \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3
- Hypergraph Turán numbers of vertex disjoint cycles
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Linear trees in uniform hypergraphs
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Hypergraph removal lemmas via robust sharp threshold theorems
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Paths in hypergraphs: a rescaling phenomenon
- Extremal Problems for Hypergraph Blowups of Trees
- Integer sequences without singleton intersection
- Set systems without a 3-simplex
- Short proofs of three results about intersecting systems
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs
- On set systems without singleton intersections
- Set systems containing no singleton intersection and the Delsarte number
- A partial edge-density version of the Corrádi-Hajnal theorem in hypergraphs
This page was built for publication: Set Systems with No Singleton Intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426888)
