On a Conjecture of Nagy on Extremal Densities

We disprove a conjecture of Nagy on the maximum number of copies N(G,H) of a fixed graph G in a large graph H with prescribed edge density. Nagy conjectured that for all G, the quantity N(G,H) is asymptotically maximised by either a quasi-star or a quasi-clique. We show this is false for infinitely many graphs, the smallest of which has 6 vertices and 6 edges. We also propose some new conjectures for the behaviour of N(G,H), and present some evidence for them.

[1]  S. Janson,et al.  Upper tails for subgraph counts in random graphs , 2004 .

[2]  Richard W. Kenyon,et al.  Multipodal Structure and Phase Transitions in Large Constrained Graphs , 2014, ArXiv.

[3]  Alexander Sidorenko,et al.  A correlation inequality for bipartite graphs , 1993, Graphs Comb..

[4]  Jonathan Cutler,et al.  Extremal Problems for Independent Set Enumeration , 2011, Electron. J. Comb..

[5]  Andrzej Dudek,et al.  Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence , 2010, J. Comb. Optim..

[6]  Christian Reiher,et al.  The clique density theorem , 2012, 1212.2454.

[7]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[8]  Dániel T. Nagy.  On the Number of 4-Edge Paths in Graphs With Given Edge Density , 2017, Comb. Probab. Comput..

[9]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[10]  J. Kahn,et al.  On the number of copies of one hypergraph in another , 1998 .

[11]  Maximum star densities , 2017, Studia Scientiarum Mathematicarum Hungarica.

[12]  N. Alon.  On the number of subgraphs of prescribed type of graphs with a given number of edges , 1981 .

[13]  R. Ahlswede,et al.  Graphs with maximal number of adjacent pairs of edges , 1978 .

[14]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[15]  D'aniel Gerbner,et al.  On the maximum number of copies of H in graphs with given size and order , 2021, J. Graph Theory.