Home
Home
Technical Skills
Experience
Publications
Projects
Educations
Talks
Contact
Personal Info
Light
Dark
Automatic
Group divisible design
Packing cliques in 3‐uniform hypergraphs
For positive integers $n\geq k\geq t$ , a collection $B$ of $k$‐subsets of an $n$‐set is called a $t$‐packing if every $t$‐subset of …
Ramin Javadi
,
Ehsan Poorhadi
,
Farshad Fallah
PDF
Cite
Cite
×