Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence

We study the extremal parameter N(n,m,H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work of Alon (Isr. J. Math. 38:116–130, 1981), Friedgut and Kahn (Isr. J. Math. 105:251–256, 1998) and Janson, Oleszkiewicz and the third author (Isr. J. Math. 142:61–92, 2004), we obtain an asymptotic formula for N(n,m,H) which is strongly related to the solution αq(H) of a linear programming problem, called here the fractional q-independence number of H. We observe that αq(H) is a piecewise linear function of q and determine it explicitly for some ranges of q and some classes of H. As an application, we derive exponential bounds on the upper tail of the distribution of the number of copies of H in a random hypergraph.

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

[2]  B. Bollobás.  The evolution of random graphs , 1984 .

[3]  M. A. Perles.  ON THE NUMBER OF SUBGRAPHS OF PRESCRIBED TYPE OF GRAPHS WITH A GIVEN NUMBER OF EDGES* , 2007 .

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

[5]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[6]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[7]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[8]  Svante Janson,et al.  Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.

[9]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[10]  B. Bollobás.  Threshold functions for small subgraphs , 1981 .

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

[12]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[13]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .