REAL

On the maximum number of copies of H in graphs with given size and order

Gerbner, Dániel and Nagy, Dániel and Patkós, Balázs and Vizer, Máté (2020) On the maximum number of copies of H in graphs with given size and order. JOURNAL OF GRAPH THEORY. ISSN 0364-9024

[img]
Preview
Text
1810.pdf
Available under License Creative Commons Attribution.

Download (343kB) | Preview

Abstract

We study the maximum number ex (n, e, H) of copies of a graph H in graphs with a given number of vertices and edges. We show that for any fixed graph H, ex (n, e, H) is asymptotically realized by the quasi-clique provided that the edge density is sufficiently large. We also investigate a variant of this problem, when the host graph is bipartite. © 2020 Wiley Periodicals, Inc.

Item Type: Article
Uncontrolled Keywords: GEOMETRY; Graph theory; Bipartite graph; extremal graph theory; Edge densities; Fixed graphs; quasi-clique; number of subgraphs;
Subjects: Q Science / természettudomány > QA Mathematics / matematika
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 24 Sep 2020 07:12
Last Modified: 24 Apr 2023 07:17
URI: http://real.mtak.hu/id/eprint/114231

Actions (login required)

Edit Item Edit Item