Counting cliques with prescribed intersection sizes
From MaRDI portal
Cites work
- An L-system on the small Witt design
- Families of finite sets in which no set is covered by the union of \(r\) others
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Generalized Turán problems for disjoint copies of graphs
- scientific article; zbMATH DE number 4104975 (Why is no real title available?)
- scientific article; zbMATH DE number 3675897 (Why is no real title available?)
- scientific article; zbMATH DE number 3561362 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Intersection Properties of Systems of Finite Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Invitation to intersection problems for finite sets
- Many \(T\) copies in \(H\)-free graphs
- Maximum cliques in a graph without disjoint given subgraph
- On a packing and covering problem
- On finite set-systems whose every intersection is a kernel of a star
- On intersecting families of finite sets
- On the size of maximal binary codes with 2, 3, and 4 distances
- Sections of Varieties Over Finite Fields as Large Intersectionc Families
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete nontrivial-intersection theorem for systems of finite sets
- The generalized Turán problem of two intersecting cliques
- Uniform eventown problems
This page was built for publication: Counting cliques with prescribed intersection sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349159)
