Skip to main content
Log in

The edge-statistics conjecture for ℓ ≪ k6/5

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

Let k and be positive integers. We prove that if 1 ≤ ℓ ≤ Ok(k6/5), then in every large enough graph G, the fraction of k-vertex subsets that induce exactly edges is at most 1/e + ok(1). Together with a recent result of Kwan, Sudakov and Tran, this settles a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Alon, D. Hefetz, M. Krivelevich and M. Tyomkyn, Edge-statistics on large graphs, preprint, https://doi.org/abs/1805.06848.

  2. J. Balogh, P. Hu, B. LidickÝ and F. Pfender, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, European Journal of Combinatorics 52 (2016), 47–58.

    Article  MathSciNet  Google Scholar 

  3. J. Fox and L. Sauermann, A completion of the proof of the Edge-statistics Conjecture, preprint, https://doi.org/abs/1809.01352.

  4. H. Hatami, J. Hirst and S. Norine, The inducibility of blow-up graphs, Journal of Combinatorial Theory. Series B 109 (2014), 196–212.

    Article  MathSciNet  Google Scholar 

  5. D. Hefetz and M. Tyomkyn, On the inducibility of cycles, Journal of Combinatorial Theory. Series B 133 (2018), 243–258.

    Article  MathSciNet  Google Scholar 

  6. D. Kral’, S. Norin and J. Volec, A bound on the inducibility of cycles, Journal of Combinatorial Theory. Series A 161 (2019), 359–363.

    Article  MathSciNet  Google Scholar 

  7. M. Kwan, B. Sudakov and T. Tran, Anticoncentration for subgraph statistics, Journal of the London Mathematical Society 99 (2019), 757–777.

    Article  MathSciNet  Google Scholar 

  8. N. Pippenger and M. C. Golumbic, The inducibility of graphs, Journal of Combinatorial Theory. Series B 19 (1975), 189–203.

    Article  MathSciNet  Google Scholar 

  9. R. Yuster, On the exact maximum induced density of almost all graphs and their inducibility, Journal of Combinatorial Theory. Series B 136 (2019), 81–109.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Mousset.

Additional information

Research supported by ISF grants 1028/16 and 1147/14, and ERC Starting Grant 633509 (FM), and by grant no. 200021 169242 of the Swiss National Science Foundation (MT). Part of this work has been completed at a workshop of the research group of Angelika Steger in Buchboden in July 2018.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Martinsson, A., Mousset, F., Noever, A. et al. The edge-statistics conjecture for ℓ ≪ k6/5. Isr. J. Math. 234, 677–690 (2019). https://doi.org/10.1007/s11856-019-1929-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-019-1929-8

Navigation