k copies of a subgraph, and a related problem in search theory

Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener. k copies of a subgraph, and a related problem in search theory. Discrete Applied Mathematics, 341:196-203, December 2023. [doi]

Authors

Dániel Gerbner

This author has not been identified. Look up 'Dániel Gerbner' in Google

Balázs Keszegh

This author has not been identified. Look up 'Balázs Keszegh' in Google

Dániel Lenger

This author has not been identified. Look up 'Dániel Lenger' in Google

Dániel T. Nagy

This author has not been identified. Look up 'Dániel T. Nagy' in Google

Dömötör Pálvölgyi

This author has not been identified. Look up 'Dömötör Pálvölgyi' in Google

Balázs Patkós

This author has not been identified. Look up 'Balázs Patkós' in Google

Máté Vizer

This author has not been identified. Look up 'Máté Vizer' in Google

Gábor Wiener

This author has not been identified. Look up 'Gábor Wiener' in Google