Generalized Turan problems for disjoint copies of graphs
2019
Abstract
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n, H, F). We investigate the function ex(n, H, kF), where kF denotes k vertex disjoint copies of a fixed graph F. Our results include cases when F is a complete graph, cycle or a complete bipartite graph. (C) 2019 Elsevier B.V. All rights reserved.
Details
Title
Generalized Turan problems for disjoint copies of graphs
Author(s)
Gerbner, Daniel ; Methuku, Abhishek ; Vizer, Mate
Published in
Discrete Mathematics
Volume
342
Issue
11
Pages
3130-3141
Date
2019-11-01
Publisher
Amsterdam, ELSEVIER
ISSN
0012-365X
1872-681X
1872-681X
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
DCG
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2019-10-03