Skip to main content
    • Aa
    • Aa

Minimum Number of Monotone Subsequences of Length 4 in Permutations

  • JÓZSEF BALOGH (a1) (a2), PING HU (a1), BERNARD LIDICKÝ (a1) (a3), OLEG PIKHURKO (a4), BALÁZS UDVARI (a2) and JAN VOLEC (a4)...

We show that for every sufficiently large n, the number of monotone subsequences of length four in a permutation on n points is at least \begin{equation*} \binom{\lfloor{n/3}\rfloor}{4} + \binom{\lfloor{(n+1)/3}\rfloor}{4} + \binom{\lfloor{(n+2)/3}\rfloor}{4}. \end{equation*} Furthermore, we characterize all permutations on [n] that attain this lower bound. The proof uses the flag algebra framework together with some additional stability arguments. This problem is equivalent to some specific type of edge colourings of complete graphs with two colours, where the number of monochromatic K4 is minimized. We show that all the extremal colourings must contain monochromatic K4 only in one of the two colours. This translates back to permutations, where all the monotone subsequences of length four are all either increasing, or decreasing only.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2] N. Alon and A. Shapira (2008) A characterization of the (natural) graph properties testable with one-sided error. SIAM J. Comput. 37 17031727.

[6] R. Baber and J. Talbot (2014) A solution to the 2/3 conjecture. SIAM J. Discrete Math. 28 756766.

[7] J. Balogh , P. Hu , B. Lidický and H. Liu (2014) Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. European J. Combin. 35 7585.

[8] B. Borchers (1999) CSDP: A C library for semidefinite programming. Optimization Methods and Software 11 613623.

[9] J. Cummings , D. Kráľ , F. Pfender , K. Sperfeld , A. Treglown and M. Young (2013) Monochromatic triangles in three-coloured graphs. J. Combin. Theory Ser. B 103 489503.

[10] S. Das , H. Huang , J. Ma , H. Naves and B. Sudakov (2013) A problem of Erdős on the minimum number of k-cliques. J. Combin. Theory Ser. B 103 344373.

[13] G. Giraud (1979) Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey. J. Combin. Theory Ser. B 27 237253.

[14] R. Glebov , D. Kráľ and J. Volec (2013) A problem of Erdős and Sós on 3-graphs. In The Seventh European Conference on Combinatorics, Graph Theory and Applications, Vol. 16 of CRM Series, Ed. Norm., Pisa. pp. 38.

[15] A. W. Goodman (1959) On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66 778783.

[16] A. Grzesik (2012) On the maximum number of five-cycles in a triangle-free graph. J. Combin. Theory Ser. B 102 10611066.

[18] H. Hatami , J. Hladký , D. Kráľ , S. Norine and A. Razborov (2013) On the number of pentagons in triangle-free graphs. J. Combin. Theory Ser. A 120 722732.

[21] D. Kráľ , L. Mach and J.-S. Sereni (2012) A new lower bound based on Gromov's method of selecting heavily covered points. Discrete Comput. Geom. 48 487498.

[24] O. Pikhurko (2011) The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. European J. Combin. 32 11421155.

[30] A. A. Razborov (2013) Flag algebras: An interim report. In The Mathematics of Paul Erdős II, Springer, pp. 207232.

[31] A. A. Razborov (2013) On the Caccetta–Häggkvist conjecture with forbidden subgraphs. J. Graph Theory 74 236248.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 21 *
Loading metrics...

Abstract views

Total abstract views: 124 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd September 2017. This data will be updated every 24 hours.